Skip to main content
SpringerLink
Log in

Minimum k-Connected Geometric Networks

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 77 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Ahuja RK, Magnanti TL, Orlin JB, Reddy MR (1995) Applications of network optimization. In: Ball MO, Magnanti TL, Monma CL and Nemhauser GL (eds) Handbooks in operations research and management science, vol 7: network models chapter 1. North-Holland, pp 1–83

    Google Scholar 

  2. Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45(5):753–782

    Article  MathSciNet  MATH  Google Scholar 

  3. Berger A, Czumaj A, Grigni M, Zhao H (2005) Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA), Palma de Mallorca, pp 472–483

    Google Scholar 

  4. Borradaile G, Klein PN (2008) The two-edge connectivity survivable network problem in planar graphs. In: Proceedings of the 35th Annual International Colloquium on Automata Languages and Programming (ICALP), Reykjavik, pp 485–501

    Google Scholar 

  5. Cheriyan J, Vetta A (2005) Approximation algorithms for network design with metric costs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), Baltimore, pp 167–175

    Google Scholar 

  6. Czumaj A, Lingas A (1999) On approximability of the minimum-cost k-connected spanning subgraph problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, pp 281–290

    Google Scholar 

  7. Czumaj A, Lingas A (2000) Fast approximation schemes for Euclidean multi-connectivity problems. In: Proceedings of the 27th Annual International Colloquium on Automata, Languages and Programming (ICALP), Geneva, pp 856–868

    Google Scholar 

  8. Czumaj A, Lingas A, Zhao H (2002) Polynomial-time approximation schemes for the Euclidean survivable network design problem. In: Proceedings of the 29th Annual International Colloquium on Automata, Languages and Programming (ICALP), Málaga, pp 973–984

    Google Scholar 

  9. Frederickson GN, JáJá J (1982) On the relationship between the biconnectivity augmentation and traveling salesman problem. Theor Comput Sci 19(2):189–201

    Article  MATH  Google Scholar 

  10. Gabow HN, Goemans MX, Williamson DP (1998) An efficient approximation algorithm for the survivable network design problem. Math Progr Ser B 82(1–2):13–40

    MathSciNet  MATH  Google Scholar 

  11. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  12. Goemans MX, Williamson DP (1996) The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum D (ed) Approximation algorithms for \(\mathcal{N}\mathcal{P}\)-hard problems, chapter 4. PWS, Boston, pp 144–191

    Google Scholar 

  13. Grötschel M, Monma CL, Stoer M (1992) Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper Res 40(2):309–330

    Article  MathSciNet  MATH  Google Scholar 

  14. Grötschel M, Monma CL, Stoer M (1995) Design of survivable networks. In: Handbooks in operations research and management science, vol 7: network models, chapter 10. North-Holland, pp 617–672

    Google Scholar 

  15. Hwang FK, Richards DS, Winter P (1992) The Steiner tree problem. North-Holland, Amsterdam

    MATH  Google Scholar 

  16. Khuller S (1996) Approximation algorithms for finding highly connected subgraphs. In: Hochbaum D (ed) Approximation algorithms for \(\mathcal{N}\mathcal{P}\)-hard problems, chapter 6. PWS, Boston, pp 236–265

    Google Scholar 

  17. Mitchell JSB (1999) Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J Comput 28(4):1298–1309

    Article  MathSciNet  MATH  Google Scholar 

  18. Monma CL, Shallcross DF (1989) Methods for designing communications networks with certain two-connected survivability constraints. Oper Res 37(4):531–541

    Article  Google Scholar 

  19. Stoer M (1992) Design of survivable networks. Springer, Berlin

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Centre for Discrete Mathematics and Its Applications, University of Warwick, Coventry, UK

    Artur Czumaj

  2. Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden

    Andrzej Lingas

Authors
  1. Artur Czumaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Artur Czumaj .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Czumaj, A., Lingas, A. (2016). Minimum k-Connected Geometric Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_237

Download citation

Publish with us

Policies and ethics

Search

Navigation