- Published 2002 in FSTTCS

In this paper we investigate the problem of finding a 2-connected spanning subgraph of minimal cost in a complete and weighted graph G. This problem is known to be APX-hard, for both the edge and the vertex connectivity case. Here we prove that theAPX-hardness still holds even if one restricts the edge costs to an interval [1, 1+ε], for an arbitrary small ε > 0. This result implies the first explicit lower bound on the approximability of the general version (i.e., for arbitrary graphs) of the problem. On the other hand, if the input graph satisfies the sharpened -triangle inequality, then a ( 2 3 + 3 · 1− ) -approximation algorithm is designed. This ratio tends to 1 with tending to 1 2 , This work was partially supported by DFG-grant Hr 14/5-1, the Research Project GRID.IT, partially funded by the Italian Ministry of Education, University and Research, the European projects RTN ARACNE (Contract No. HPRN-CT-1999-00112) and IST FET CRESCCO (Contract No. IST-2001-33135). A preliminary version of this paper appeared in Proc. of the 22nd Foundations of Software Technology and Theoretical Computer Science (FSTTCS’02), Vol. 2556 of Lecture Notes in Computer Science, Springer-Verlag, 2002, 59–70. ∗ Corresponding author. Dipartimento di Informatica, Università di L’Aquila,ViaVetoio, 67010 L’Aquila, Italy. E-mail addresses: hjb@cs.rwth-aachen.de (H.-J. Böckenhauer), bongartz@cs.rwth-aachen.de (D. Bongartz), jh@cs.rwth-aachen.de (J. Hromkovič), ralf.klasing@sophia.inria.fr (R. Klasing), proietti@ns.di.univaq.it (G. Proietti), seibert@cs.rwth-aachen.de (S. Seibert), quax@cs.rwth-aachen.de (W. Unger). 0304-3975/$ see front matter © 2004 Elsevier B.V. All rights reserved. doi:10.1016/j.tcs.2004.06.019 138 H.-J. Böckenhauer et al. / Theoretical Computer Science 326 (2004) 137–153 and it improves the previous known bound of 3 2 , holding for graphs satisfying the triangle inequality, as soon as < 7 . Furthermore, a generalized problem of increasing to 2 the edge-connectivity of any spanning subgraph of G by means of a set of edges of minimum cost is considered. This problem is known to admit a 2-approximation algorithm. Here we show that whenever the input graph satisfies the sharpened -triangle inequality with < 3 , then this ratio can be improved to 1− . © 2004 Elsevier B.V. All rights reserved.

@article{Bckenhauer2002OnTH,
title={On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality},
author={Hans-Joachim B{\"{o}ckenhauer and Dirk Bongartz and Juraj Hromkovic and Ralf Klasing and Guido Proietti and Sebastian Seibert and Walter Unger},
journal={Theor. Comput. Sci.},
year={2002},
volume={326},
pages={137-153}
}