Approximation algorithms for network design with metric costs

DOI10.1145/1060590.1060616MaRDI QIDQ3581389zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581389)