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

Authors:
R. Ravi;David P. Williamson
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Almaden Research Center, San Jose, CA
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 2
Cited 4

The primal-dual method for approximation algorithms and its application to network design problems

Approximation algorithms for NP-hard problems
An approximation algorithm for minimum-cost vertex-connectivity problems

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs

Discrete Applied Mathematics
Hardness of Approximation for Vertex-Connectivity Network-Design Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

Journal of Computer and System Sciences - Special issue on FOCS 2001
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

There is an error in our paper "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems," which appeared in SODA '95 [2] (see also the journal version [3]). Below we briefly describe the problem and discuss which of our results can be shown to hold.A complete version of our erratum can be found at www.almaden.ibm.com/cs/people/dpw.