Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 2004: LATIN 2004: Theoretical Informatics pp 212–221Cite as

Finding k-Connected Subgraphs with Minimum Average Weight

  • Conference paper

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

Abstract

We consider the problems of finding k-connected spanning subgraphs with minimum average weight. We show that the problems are NP-hard for k>1. Approximation algorithms are given for four versions of the minimum average edge weight problem:

  1. 1

    3-approximation for k-edge-connectivity,

  2. 2

    O(logk) approximation for k-node-connectivity

  3. 3

    2+ ε approximation for k-node-connectivity in Euclidian graphs, for any constant ε> 0,

  4. 4

    5.8-approximation for k-node-connectivity in graphs satisfying the triangle inequality.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cheriyan, J., Thurimella, R.: Approximating minimum-size k-connected spanning subgraphs via Matching. SIAM J. Comput. 30, 528–560 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimum-cost k-vertex connected subgraphs. In: STOC 2002, pp. 306–312 (2002)

    Google Scholar 

  3. Fernandes, C.G.: A better approximation for the minimum k-edge-connected spanning subgraph problem. J. Algorithms 28, 105–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Frederickson, G.N., JáJá, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 5, 25–53 (1982)

    Google Scholar 

  5. Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. Assoc. Comput. Mach. 41, 214–235 (1994)

    MATH  MathSciNet  Google Scholar 

  6. Czumaj, A., Lingas, A.: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 682–694. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Czumaj, A., Lingas, A.: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete. Algoithms (SODA), pp. 281–290 (1999)

    Google Scholar 

  8. Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23, 309–311 (1978)

    MATH  MathSciNet  Google Scholar 

  9. Ahuja, R.K., Orlin, J.B.: New scaling algorithms for assignment and minimum cycle mean problems. Mathematical Programming 54, 41–56 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Texas at Dallas, Richardson, TX, 75080

    Prabhakar Gubbala & Balaji Raghavachari

Authors
  1. Prabhakar Gubbala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Balaji Raghavachari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rutgers University, NJ 08854, Piscataway

    Martín Farach-Colton

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gubbala, P., Raghavachari, B. (2004). Finding k-Connected Subgraphs with Minimum Average Weight. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24698-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21258-4

  • Online ISBN: 978-3-540-24698-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation