Skip to main content
SpringerLink
Log in

Factor 4/3 Approximations for Minimum 2-Connected Subgraphs

  • Conference paper
  • First Online:
Book cover Approximation Algorithms for Combinatorial Optimization (APPROX 2000)

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

Abstract

We present factor \( \tfrac{4} {3} \) approximation algorithms for the problems of finding theminimum 2-edge connected and theminimum 2-vertex connected spanning subgraph of a given undirected graph.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carr, R., Ravi, R.: A new bound for the 2-edge connected subgraph problem. Proc 6th Annual International IPCO (1998)

    Google Scholar 

  2. Cheriyan, J., Sebö, A., Sigeti, Z.: Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph. Proc 6th Annual International IPCO (1998)

    Google Scholar 

  3. N. Garg, A. Singla, S. Vempala, Improved approximations for biconnected subgraphs via better lower bounding techniques. Proc 6th Annual SODA (1993)

    Google Scholar 

  4. M. Grötschel, L. Lovász and A. Schrijver, Geometric algorithms and combinatorial optimization. Springer-Verlag, New York (1988)

    MATH  Google Scholar 

  5. D. Hartvigsen, Extensions of Matching Theory. Ph.D. thesis, GSIA, Carnegie Mellon University (1984)

    Google Scholar 

  6. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings. Journal of the ACM 41 (1994) 214–35

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Massachusetts Institute of Technology, Massachusetts

    Santosh Vempala & Adrian Vetta

Authors
  1. Santosh Vempala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adrian Vetta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Christian-Albrechts-Universität zu Kiel Institut für Informatik und praktische Mathematik Olshausenstr, 40, 24098, Kiel, Germany

    Klaus Jansen

  2. Computer Science Department, University of Maryland, A.V. Williams Bldg College Park, MD 20742, USA

    Samir Khuller

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vempala, S., Vetta, A. (2000). Factor 4/3 Approximations for Minimum 2-Connected Subgraphs. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-44436-X_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67996-7

  • Online ISBN: 978-3-540-44436-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation