Network Design Approximation

Network Design Approximation is a computational framework within algorithmic optimization that specifically addresses the construction of cost-effective network topologies under constraints by providing provably near-optimal solutions to NP-hard problems in graph connectivity, edge selection, and infrastructure planning.

153

Publications

9.2K

Citations

234

Authors

122

Institutions

Publications per year

2017–2026

14

Authors

234

  1. RR
    R. Ravi

    Carnegie Mellon University, United States

    16 publications · 1.3K citations

    15

    h-index

  2. AG
    Anupam Gupta

    Carnegie Mellon University, United States

    11 publications · 514 citations

    11

    h-index

  3. CC
    Chandra Chekuri

    University of Illinois Urbana-Champaign, United States

    10 publications · 440 citations

    10

    h-index

  4. JC
    Joseph Cheriyan

    University of Waterloo, Canada

    8 publications · 332 citations

    8

    h-index

  5. SK
    Sanjeev Khanna

    University of Pennsylvania, United States

    7 publications · 311 citations

    7

    h-index

1–5 of 234

Venues

  1. SIAM Journal on Computing

    12 publications · 902 citations

    12

    h-index

  2. Algorithmica

    6 publications · 324 citations

    6

    h-index

  3. Networks

    5 publications · 572 citations

    5

    h-index

  4. ACM Transactions on Algorithms

    TALG · 5 publications · 168 citations

    5

    h-index

  5. Transportation Research Part B Methodological

    4 publications · 474 citations

    4

    h-index

1–5