Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Minimum k-Connected Geometric Networks

  • Artur Czumaj
  • Andrzej Lingas
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_237


Euclideangraphs;Geometric graphs

Years and Authors of Summarized Original Work

  • 2000; Czumaj, Lingas

Problem Definition

The following classical optimization problem is considered: for a given undirected weighted geometric network, find its minimum-cost subnetwork that satisfies a priori given multi-connectivity requirements. This problem restricted to geometric networks is considered in this entry.


Let G = (V, E) be a geometric network, whose vertex set V corresponds to a set of n points in \(\mathbb{R}^{d}\)


Geometric networks Geometric optimization k-connectivity Network design Survivable network design 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 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–83Google Scholar
  2. 2.
    Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45(5):753–782MathSciNetMATHCrossRefGoogle Scholar
  3. 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–483Google Scholar
  4. 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–501Google Scholar
  5. 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–175Google Scholar
  6. 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–290Google Scholar
  7. 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–868Google Scholar
  8. 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–984Google Scholar
  9. 9.
    Frederickson GN, JáJá J (1982) On the relationship between the biconnectivity augmentation and traveling salesman problem. Theor Comput Sci 19(2):189–201MATHCrossRefGoogle Scholar
  10. 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–40MathSciNetMATHGoogle Scholar
  11. 11.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New YorkMATHGoogle Scholar
  12. 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–191Google Scholar
  13. 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–330MathSciNetMATHCrossRefGoogle Scholar
  14. 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–672Google Scholar
  15. 15.
    Hwang FK, Richards DS, Winter P (1992) The Steiner tree problem. North-Holland, AmsterdamMATHGoogle Scholar
  16. 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–265Google Scholar
  17. 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–1309MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    Monma CL, Shallcross DF (1989) Methods for designing communications networks with certain two-connected survivability constraints. Oper Res 37(4):531–541CrossRefGoogle Scholar
  19. 19.
    Stoer M (1992) Design of survivable networks. Springer, BerlinMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Computer Science, Centre for Discrete Mathematics and Its ApplicationsUniversity of WarwickCoventryUK
  2. 2.Department of Computer ScienceLund UniversityLundSweden