Skip to main content

A polynomial time approximation scheme for euclidean minimum cost k-connectivity

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

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

Included in the following conference series:

Abstract

We present polynomial-time approximation schemes for the problem of finding a minimum-cost k-connected Euclidean graph on a finite point set in R d. The cost of an edge in such a graph is equal to the Euclidean distance between its endpoints. Our schemes use Steiner points. For every given c > 1 and a set S of n points in ℝd, a randomized version of our scheme finds an Euclidean graph on a superset of S which is k-vertex (or k-edge) connected with respect to S, and whose cost is with probability 1/2 within (1 + 1/c) of the minimum cost of a k-vertex (or k-edge) connected Euclidean graph on S, in time \(n \cdot \left( {logn} \right)^{\left( {\mathcal{O}\left( {c\sqrt d k} \right)} \right)^{d - 1} } \cdot 2^{\left( {\left( {\mathcal{O}\left( {c\sqrt d k} \right)} \right)^{d - 1} } \right)!}\). We can derandomize the scheme by increasing the running time by a factor O(n). We also observe that the time cost of the derandomization of the PTA schemes for Euclidean optimization problems in ℝd derived by Arora can be decreased by a multiplicative factor of Ω(n d−1 ).

Research supported in part by ALCOM EU ESPRIT Long Term Research Project 20244 (ALCOM-IT), by DFG Grant Me872/7-l, and by TFR grant 96-278.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. 37th FOCS'96, pp. 2–11.

    Google Scholar 

  2. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. 38th FOCS'97, pp. 554–563.

    Google Scholar 

  3. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Submitted for journal publication, June 1997. This is a full version combining [1] and [2].

    Google Scholar 

  4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York, NY, 1979.

    Google Scholar 

  5. D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1996.

    Google Scholar 

  6. S. Khuller. Approximation algorithms for finding connected subgraphs. Chapter 6 in [5].

    Google Scholar 

  7. D. Krznaric, C. Levcopoulos, G. Narasimhan, B. J. Nilsson, and M. Smid. The minimum 2-connected subgraph of a set of points. Manuscript, September 15,1997.

    Google Scholar 

  8. J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. To appear in SIAM J. Comput., 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czumaj, A., Lingas, A. (1998). A polynomial time approximation scheme for euclidean minimum cost k-connectivity. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055093

Download citation

  • DOI: https://doi.org/10.1007/BFb0055093

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics