Approximating k-outconnected subgraph problems | SpringerLink
Skip to main content
Springer Nature Link
Log in

Approximating k-outconnected subgraph problems

  • Conference paper
  • First Online:
Approximation Algorithms for Combinatiorial Optimization (APPROX 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1444))

  • 139 Accesses

Abstract

We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding min-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outconnected graphs and proving (i) a version of Mader's critical cycle theorem and (ii) an extension of a splitting off theorem by Bienstock et al.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Bienstock, E. F. Brickell and C. L. Monma, “On the structure of minimum-weight k-connected spanning networks,” SIAM J. Discrete Math. 3 (1990), 320–329.

    Article  MATH  MathSciNet  Google Scholar 

  2. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.

    Google Scholar 

  3. J.Cheriyan and R.Thurimella, “Approximating minimum-size k-connected spanning subgraphs via matching,” manuscript, Sept. 1996. ECCC TR98-025, see http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1998.html. Preliminary version in Proc. 37th IEEE FOCS (1996), 292–301.

    Google Scholar 

  4. A.Frank and E. Tardos, “An application of submodular flows,” Linear Algebra and its Applications, 114/115 (1989), 320–348.

    Article  MathSciNet  Google Scholar 

  5. G.L.Frederickson and J. Ja'Ja', “On the relationship between the biconnectivity augmentation and traveling salesman problems,” Theor. Comp. Sci. 19 (1982), 189–201.

    Article  MATH  MathSciNet  Google Scholar 

  6. H. N. Gabow and R. E. Tarjan, “Faster scaling algorithms for general graph matching problems,” Journal of the ACM 38 (1991), 815–853.

    Article  MATH  MathSciNet  Google Scholar 

  7. T. Jordán, “On the optimal vertex-connectivity augmentation,” J. Combinatorial Theory, Series B 63 (1995), 8–20.

    Article  MATH  Google Scholar 

  8. S. Khuller, “Approximation algorithms for finding highly connected subgraphs,” in Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS publishing co., Boston, 1996.

    Google Scholar 

  9. S. Khuller and B. Raghavachari, “Improved approximation algorithms for uniform connectivity problems,” Journal of Algorithms 21 (1996), 434–450.

    Article  MATH  MathSciNet  Google Scholar 

  10. W. Mader, “Ecken vom Grad n in minimalen n-fach zusammenhÄngenden Graphen,” Archive der Mathematik 23 (1972), 219–224.

    Article  MATH  MathSciNet  Google Scholar 

  11. H.Nagamochi and T.Ibaraki, “A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph,” Algorithmica 7 (1992), 583–596.

    Article  MATH  MathSciNet  Google Scholar 

  12. Z.Nutov, M.Penn and D.Sinreich, “On mobile robots flow in locally uniform networks,” Canadian Journal of Information Systems and Operational Research 35 (1997), 197–208.

    Google Scholar 

  13. R. Ravi and D. P. Williamson, “An approximation algorithm for minimum-cost vertex-connectivity problems.” Algorithmica (1997) 18: 21–43.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Joseph Cheriyan & Zeev Nutov

  2. Institut for Matematik og Datalogi, Odense Universitet, Odense, Denmark

    Tibor Jordán

Authors
  1. Joseph Cheriyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tibor Jordán
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zeev Nutov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus Jansen José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheriyan, J., Jordán, T., Nutov, Z. (1998). Approximating k-outconnected subgraph problems. In: Jansen, K., Rolim, J. (eds) Approximation Algorithms for Combinatiorial Optimization. APPROX 1998. Lecture Notes in Computer Science, vol 1444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053965

Download citation

  • DOI: https://doi.org/10.1007/BFb0053965

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64736-2

  • Online ISBN: 978-3-540-69067-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation