Abstract
Geometric optimization problems arise in many disciplines and are often NP- hard. One example is the famous Traveling Salesman Problem (TSP): given n points in the plane (more generally, in ℜd), find the shortest closed path that visits them all.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. JACM 45(5) 753–782, 1998. Preliminary versions in Proceedings of 37th IEEE Symp. on Foundations of Computer Science, 1996, and Proceedings of 38th IEEE Symp. on Foundations of Computer Science, 1997.
S. Arora and G. Karakostas. Approximation schemes for minimum latency problems. Proc. ACM Symposium on Theory of Computing, 1999.
S. Arora, P. Raghavan, and S. Rao. Approximation schemes for the Euclidean k-medians andrelatedproblems. In In Proc. 30th ACM Symposium on Theory of Computing, pp 106–113, 1998.
T. Asano, N. Katoh, H. Tamaki and T. Tokuyama. Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. In Proc. 29th Annual ACM Symposium on Theory of Computing, pp 275–283, 1997.
A. Barvinok, S. Fekete, D. S. Johnson, A. Tamir, G. J. Woeginger, R. Woodroofe. The maximum traveling salesman problem. Merger of two papers in Proc. IPCO 1998 and Proc. ACM-SIAM SODA 1998.
M. Bern and D. Eppstein. Approximation algorithms for geometric problems. In [10].
N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In J.F. Traub, editor, Symposium on new directions and recent results in algorithms and complexity, page 441. Academic Press, NY, 1976.
A. Czumaj and A. Lingas. A polynomial time approximation scheme for Euclidean minimum cost k-connectivity. Proc. 25th Annual International Colloquium on Automata, Languages and Programming, LNCS, Springer Verlag 1998.
W. Fernandez de la Vega and C. Kenyon. A randomized approximation scheme for metric MAX-CUT. Proc. 39th IEEE Symp. on Foundations of Computer Science, pp 468–471, 1998.
D. Hochbaum, ed. Approximation Algorithms for NP-hard problems. PWS Publishing, Boston, 1996.
S. G. Kolliopoulos and S. Rao. A nearly linear time approximation scheme for the Euclidean k-median problem. LNCS, vol.1643, pp 378–387, 1999.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. The traveling salesman problem. John Wiley, 1985
J. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple PTAS for geometric k-MST, TSP, andrelatedproblems. SIAM J. Comp., 28, 1999. Preliminary manuscript, April 30, 1996. To appear in SIAM J. Computing.
S. Rao and W. Smith. Approximating geometric graphs via “spanners” and “banyans.” In Proc. 30th ACM Symposium on Theory of Computing, pp. 540–550, 1998.
A.Z. Zelikovsky. An 11/6-approximation algorithm for the network Steiner Problem. Algorithmica, 9:463–470, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arora, S. (2001). Approximation Schemes for Geometric NP-Hard Problems: A Survey. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive