Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems (English)
National licence
- New search for: Ravi
- New search for: Williamson
- New search for: Ravi
- New search for: Williamson
In:
Algorithmica
;
34
, 1
;
98-107
;
2002
- Article (Journal) / Electronic Resource
-
Title:Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
-
Contributors:Ravi ( author ) / Williamson ( author )
-
Published in:Algorithmica ; 34, 1 ; 98-107
-
Publisher:
- New search for: Springer-Verlag
-
Place of publication:Berlin/Heidelberg
-
Publication date:2002-09-01
-
Size:10 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 34, Issue 1
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
A Near-Linear Area Bound for Drawing Binary TreesChan et al. | 2002
- 14
-
Pinwheel Scheduling: Achievable DensitiesFishburn / Lagarias et al. | 2002
- 39
-
Splitting a Delaunay Triangulation in Linear TimeChazelle / Devillers / Hurtado / Mora / Sacristan / Teillaud et al. | 2002
- 47
-
The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can HelpJansen / Wegener et al. | 2002
- 67
-
Testing and Spot-Checking of Data StreamsFeigenbaum / Kannan / Strauss / Viswanathan et al. | 2002
- 81
-
Realistic Input Models for Geometric Algorithmsde Berg / van der Stappen / Vleugels / Katz et al. | 2002
- 98
-
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity ProblemsRavi / Williamson et al. | 2002