Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
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
Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45(5):753–782
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
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
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
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
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
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
Frederickson GN, JáJá J (1982) On the relationship between the biconnectivity augmentation and traveling salesman problem. Theor Comput Sci 19(2):189–201
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
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
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
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
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
Hwang FK, Richards DS, Winter P (1992) The Steiner tree problem. North-Holland, Amsterdam
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
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
Monma CL, Shallcross DF (1989) Methods for designing communications networks with certain two-connected survivability constraints. Oper Res 37(4):531–541
Stoer M (1992) Design of survivable networks. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-1-4939-2864-4_237
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering