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
Parents
153
The complexity of the network design problem
David Johnson, Jan Karel Lenstra, A. H. G. Rinnooy Kan · Networks · 1978 · 400 citations · Full text
1–5 of 153
234
15
h-index
11
h-index
University of Illinois Urbana-Champaign, United States
10 publications · 440 citations
10
h-index
8
h-index
7
h-index
1–5 of 234
122
Carnegie Mellon University
Pittsburgh, United States
19 h-index
38 publications
2.2K citations

Cornell University
Ithaca, United States
10 h-index
20 publications
2.1K citations

University of Waterloo
Waterloo, Canada
9 h-index
9 publications
373 citations
Stanford University
Stanford, United States
8 h-index
19 publications
2.1K citations
University of Pennsylvania
Philadelphia, United States
7 h-index
10 publications
1.4K citations

McGill University
Montreal, Canada
7 h-index
11 publications
196 citations
Technion – Israel Institute of Technology
Haifa, Israel
7 h-index
11 publications
347 citations
University of California, Berkeley
Berkeley, United States
7 h-index
13 publications
1.5K citations
1–8 of 122
12 publications · 902 citations
12
h-index
6 publications · 324 citations
6
h-index
5 publications · 572 citations
5
h-index
TALG · 5 publications · 168 citations
5
h-index
4 publications · 474 citations
4
h-index
1–5