@techreport{,
TITLE = {Approximating minimum size 1,2-connected networks},
AUTHOR = {Krysta, Piotr},
LANGUAGE = {eng},
URL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2001-1-001},
NUMBER = {MPI-I-2001-1-001},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2001},
DATE = {2001},
ABSTRACT = {The problem of finding the minimum size 2-connected subgraph is <br>a classical problem in network design. It is known to be NP-hard even on<br>cubic planar graphs and Max-SNP hard.<br>We study the generalization of this problem, where requirements of 1 or 2 <br>edge or vertex disjoint paths are specified between every pair of vertices, <br>and the aim is to find a minimum subgraph satisfying these requirements.<br>For both problems we give $3/2$-approximation algorithms. This improves on<br>the straightforward $2$-approximation algorithms for these problems, and <br>generalizes earlier results for 2-connectivity.<br>We also give analyses of the classical local optimization heuristics for<br>these two network design problems.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}