Concepedia

Approximation Algorithms For Network Flows

Approximation Algorithms for Network Flows is a computational methodology within algorithmic graph theory that belongs to the class of approximation algorithms and is specifically designed to efficiently compute near-optimal solutions for network flow problems where exact optimization is computationally intractable.

279

Publications

24K

Citations

493

Authors

249

Institutions

Publications per year

2017–2026

28

Parents

Publications

279

Combinatorial Optimization: Algorithms and Complexity.

David Johnson, Christos H. Papadimitriou, Kenneth Steiglitz · American Mathematical Monthly · 1984 · 6.1K citations

, , +16

P-Complete Approximation Problems

Sartaj Sahni, Teofilo F. Gonzalez · Journal of the ACM · 1976 · 1.7K citations · Full text

, , +17

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Tom Leighton, Satish Rao · Journal of the ACM · 1999 · 832 citations · Full text

, , +15

Fast Approximation Algorithms for Fractional Packing and Covering Problems

Serge Plotkin, David B. Shmoys, Éva Tardos · Mathematics of Operations Research · 1995 · 556 citations

, , +14

Beyond the flow decomposition barrier

Andrew V. Goldberg, Satish Rao · Journal of the ACM · 1998 · 474 citations · Full text

, , +15

1–5 of 279

Authors

493

  1. AK
    Amit Kumar

    Indian Institute of Technology Delhi, India

    7 publications · 380 citations

    7

    h-index

  2. CC
    Chandra Chekuri

    University of Illinois Urbana-Champaign, United States

    7 publications · 348 citations

    7

    h-index

  3. ÉT
    Éva Tardos

    Cornell University, United States

    6 publications · 1K citations

    6

    h-index

  4. AG
    Anupam Gupta

    Carnegie Mellon University, United States

    6 publications · 360 citations

    6

    h-index

  5. SK
    Sanjeev Khanna

    University of Pennsylvania, United States

    6 publications · 246 citations

    6

    h-index

1–5 of 493

Institutions

249

  1. Princeton University

    Princeton, United States

    16 h-index

    25 publications

    9.6K citations

  2. Massachusetts Institute of Technology

    Cambridge, United States

    14 h-index

    23 publications

    8.6K citations

  3. Cornell University

    Ithaca, United States

    12 h-index

    20 publications

    2.6K citations

  4. University of California, Berkeley

    Berkeley, United States

    10 h-index

    14 publications

    2.3K citations

  5. Stanford University

    Stanford, United States

    10 h-index

    15 publications

    1.4K citations

  6. Max Planck Society

    Munich, Germany

    8 h-index

    11 publications

    256 citations

  7. Tel Aviv University

    Tel Aviv, Israel

    8 h-index

    9 publications

    342 citations

  8. Rutgers, The State University of New Jersey

    New Brunswick, United States

    7 h-index

    10 publications

    576 citations

1–8 of 249

Venues

  1. SIAM Journal on Computing

    17 publications · 1.2K citations

    15

    h-index

  2. Networks

    10 publications · 366 citations

    10

    h-index

  3. Mathematics of Operations Research

    9 publications · 1.3K citations

    9

    h-index

  4. Journal of the ACM

    JACM · 8 publications · 3.6K citations

    8

    h-index

  5. Mathematical Programming

    6 publications · 281 citations

    6

    h-index

1–5