On the approximability of some network design problems
DOI10.1145/1361192.1361200zbMath1445.68156OpenAlexW2166747457MaRDI QIDQ4962716
Anupam Gupta, Joseph (Seffi) Naor, Julia Chuzhoy, Amitabh Sinha
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1361192.1361200
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (10)
This page was built for publication: On the approximability of some network design problems