Fast Approximation Schemes for Euclidean Multi-connectivity Problems

@inproceedings{Czumaj2000FastAS,
  title={Fast Approximation Schemes for Euclidean Multi-connectivity Problems},
  author={Artur Czumaj and Andrzej Lingas},
  booktitle={ICALP},
  year={2000}
}
We present new polynomial-time approximation schemes (PTA S) for several basic minimum-cost multi-connectivity problems i n geometrical graphs. We focus on low connectivity requirements. Each of our schem es either significantly improves the previously known upper time-bound or is the first PTAS for the considered problem. We provide a randomized approximation scheme for finding a bi connected graph spanning a set of points in a multi-dimensional Euclidean sp ace and having the expected total… CONTINUE READING
21 Citations
20 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 20 references

and A

  • A. Czuma
  • Lingas. A polynomial time approximation s cheme…
  • 1998
Highly Influential
10 Excerpts

and W

  • S. B. Ra
  • D. Smith. Improved approximation schemes for…
  • 1998
Highly Influential
10 Excerpts

n, and M

  • D. Krznaric, C. Levcopoulos, G. Narasimhan, B. J. Nilsso
  • Smid. The minimum 2-connected subgraph of a set…
  • 1997
1 Excerpt

editor

  • D. S. Hochbaum
  • Approximation Algorithms for NP-Hard Problems…
  • 1996
1 Excerpt

App lications of network optimization

  • R. K. Ahuja, T. L. Magnanti, J. B. Orlin, M. R. Reddy
  • In Nemhauser, editors, Handbooks in Operations…
  • 1995
2 Excerpts

Similar Papers

Loading similar papers…