Approximation algorithms for network design with metric costs

DOI10.1145/1060590.1060616zbMath1192.68884OpenAlexW2132620463MaRDI QIDQ3581389

Adrian Vetta, Joseph Cheriyan

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060616

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Tight approximation algorithm for connectivity augmentation problems ⋮ A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs

This page was built for publication: Approximation algorithms for network design with metric costs