On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality

Extended Abstract
  • Hans-Joachim Böckenhauer
  • Dirk Bongartz
  • Juraj Hromkovič
  • Ralf Klasing
  • Guido Proietti
  • Sebastian Seibert
  • Walter Unger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2556)


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, both for the edge- and for the vertex-connectivity case. Here we prove that the APX-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 problems.

On the other hand, if the input graph satisfies the sharpened β-triangle inequality, then a (2/3 + 1/3 . β/1-β)-approximation algorithm is designed. This ratio tends to 1 with β tending to 1/2, and it improves the previous known bound of 3/2, holding for graphs satisfying the triangle inequality, as soon as β < 5/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 β < 2/3, then this ratio can be improved to β/1-β.


Approximation algorithm inapproximability minimum-cost biconnected spanning subgraph augmentation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T. Andreae: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks 38(2) (2001), pp. 59–67.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    T. Andreae, H.-J. Bandelt: Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM Journal on Discrete Mathematics 8 (1995), pp. 1–16.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer 1999.Google Scholar
  4. 4.
    M. A. Bender, C. Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. Information Processing Letters 73 (2000), pp. 17–21.CrossRefMathSciNetGoogle Scholar
  5. 5.
    H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger: Approximation algorithms for the TSP with sharpened triangle inequality. Information Processing Letters 75, 2000, pp. 133–138.CrossRefMathSciNetGoogle Scholar
  6. 6.
    H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger: Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem (Extended Abstract). Proc. CIAC 2000, LNCS 1767, Springer 2000, pp. 72–86. Full version in Theoretical Computer Science 285(1) (2002), pp. 3–24.Google Scholar
  7. 7.
    H.-J. Böckenhauer, J. Hromkovič, R. Klasing, S. Seibert, W. Unger: An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality (Extended Abstract). Proc. STACS 2000, LNCS 1770, Springer 2000, pp. 382–394.Google Scholar
  8. 8.
    H.-J. Böckenhauer, S. Seibert: Improved lower bounds on the approximability of the traveling salesman problem. RAIRO-Theoretical Informatics and Applications 34, 2000, pp. 213–255.zbMATHCrossRefGoogle Scholar
  9. 9.
    A. Czumaj, A. Lingas: On approximability of the minimum-cost k-connected spanning subgraph problem. Proc. SODA’99, 1999, pp. 281–290.Google Scholar
  10. 10.
    L. S. Chandran, L. S. Ram: Approximations for ATSP with Parametrized Triangle Inequality. Proc. STACS 2002, LNCS 2285, Springer 2002, pp. 227–237.Google Scholar
  11. 11.
    R. G. Downey, M. R. Fellows: Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992), pp. 161–187.MathSciNetGoogle Scholar
  12. 12.
    R. G. Downey, M. R. Fellows: Parameterized Complexity. Springer 1999.Google Scholar
  13. 13.
    K. P. Eswaran, R. E. Tarjan: Augmentation Problems. SIAM Journal on Computing 5(4), 1976, pp. 653–665.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    C. G. Fernandes: A better approximation ratio for the minimum size k-edgeconnected spanning subgraph problem. J. Algorithms, 28(1) (1998), pp. 105–124.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    G. N. Frederickson, J. Jájá: On the relationship between the biconnectivity augmentation and traveling salesman problems. Theoretical Computer Science, 19 (1982), pp. 189–201.zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    A. Galluccio, G. Proietti: Polynomial time algorithms for edge-connectivity augmentation of Hamiltonian paths. Proc. ISAAC’01, LNCS 2223, Springer 2001, pp. 345–354.Google Scholar
  17. 17.
    M. R. Garey, D. S. Johnson: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco, 1979.zbMATHGoogle Scholar
  18. 18.
    M. Grötschel, L. Lovász, A. Schrijver: Geometric Algorithms and Combinatorial Optimization. Springer 1988.Google Scholar
  19. 19.
    M. Grötschel, C.L. Monma, M. Stoer: Design of survivable networks. Handbooks in OR and MS, Vol. 7, Elsevier (1995), pp. 617–672.CrossRefGoogle Scholar
  20. 20.
    J. Hromkovič: Algorithmics for Hard Problems-Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Springer 2001.Google Scholar
  21. 21.
    P. Krysta, V. S. A. Kumar: Approximation algorithms for minimum size 2-connectivity problems. Proc. STACS 2001, LNCS 2010, Springer 2001, pp. 431–442.Google Scholar
  22. 22.
    S. Khuller, R. Thurimella: Approximation algorithms for graph augmentation. Journal of Algorithms 14 (1993), pp. 214–225.zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    S. Khuller, U. Vishkin: Biconnectivity approximations and graph carvings. Journal of the ACM 41 (1994), pp. 214–235.zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    H. Nagamochi, T. Ibaraki: An approximation for finding a smallest 2-edgeconnected subgraph containing a specified spanning tree. Proc. COCOON’99, LNCS 1627, Springer 1999, pp. 31–40.Google Scholar
  25. 25.
    M. Penn, H. Shasha-Krupnik: Improved approximation algorithms for weighted 2-and 3-vertex connectivity augmentation. Journal of Algorithms 22 (1997), pp. 187–196.zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    S. Vempala, A. Vetta: Factor 4/3 approximations for minimum 2-connected subgraphs. Proc. APPROX 2000, LNCS 1913, Springer 2000, pp. 262–273.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hans-Joachim Böckenhauer
    • 1
  • Dirk Bongartz
    • 1
  • Juraj Hromkovič
    • 1
  • Ralf Klasing
    • 2
  • Guido Proietti
    • 3
  • Sebastian Seibert
    • 1
  • Walter Unger
    • 1
  1. 1.Lehrstuhl für Informatik IAachenGermany
  2. 2.Department of Computer ScienceKing’s College London StrandLondonUK
  3. 3.Dipartimento di InformaticaUniversità di L’Aquila, 67010 L’Aquila, Italy and Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”RomaItaly

Personalised recommendations