Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems

DOI10.1007/s00453-002-0970-9zbMath1017.68157OpenAlexW3149110984MaRDI QIDQ1849676

David P. Williamson, R. Ravi

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0970-9

zbMATH Keywords

primal-dual methodapproximation algorithmvertex connectivitysurvivable network design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

Improved approximation algorithms for minimum cost node-connectivity augmentation problems, Approximating minimum-cost edge-covers of crossing biset-families, A \(4+\epsilon\) approximation for \(k\)-connected subgraphs, An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity, Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems, A primal-dual approximation algorithm for the survivable network design problem in hypergraphs