About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SODA 2002
Conference paper
Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
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.