Approximation schemes for degree-restricted MST and Red-Blue Separation Problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 176-188

  Arora, Sanjeev ^a,c   Chang, Kevin L ^b  

^a PRINCETON UNIVERSITY   (United States)

^b YALE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; TREES (MATHEMATICS);

APPROXIMATION SCHEME; COST SPANNING; EUCLIDEAN; POLYNOMIAL TIME APPROXIMATION SCHEMES; QUASI-POLYNOMIAL TIME; SEPARATION PROBLEMS;

POLYNOMIAL APPROXIMATION;

EID: 35248826365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_16     Document Type: Article

References (19)

1. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of 37th IEEE Symp. on Foundations of Computer Science, 1996.
2. S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. JACM 45(5) 753-782, 1998.
3. S. Arora. Approximation schemes for NP-hard geometric optimization problems: A survey. Math Programming, 2003 (to appear). Available from www.cs.princeton.edu/~arora.
4. S. Arora and G. Karakostas. Approximation schemes for minimum latency problems. Proc. ACM Symposium on Theory of Computing, 1999.
5. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for the Euclidean k-medians and related problems. In Proc. 30th ACM Symposium on Theory of Computing, pp 106-113, 1998.
6. J. Beardwood, J. H. Halton, and J. M. Hammersley. The shortest path through many points. Proc. Cambridge Philos. Soc. 55:299-327, 1959.
7. M. Bern and D. Eppstein. Approximation algorithms for geometric problems. In [9].
8. 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.
9. D. Hochbaum, ed. Approximation Algorithms for NP-hard problems. PWS Publishing, Boston, 1996.
10. S. Khuller, B. Raghavachari, and N. Young. Low degree spanning tree of small weight. SIAM J. Computing, 25:355-368, 1996.
11. Preliminary version in Proc. 26th ACM Symposium on Theory of Computing, 1994.
12. 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.
13. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. The traveling salesman problem. John Wiley, 1985
14. C.S. Mata and J. Mitchell. Approximation Algorithms for Geometric tour and network problems. In Proc. 11th ACM Symp. Comp. Geom., pp 360-369, 1995.
15. J. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple PTAS for geometric k-MST, TSP, and related problems. SIAM J. Comp., 28, 1999.
16. Preliminary manuscript, April 30, 1996. To appear in SIAM J. Computing.
17. C. H. Papadimitriou and U. V. Vazirani. On two geometric problems related to the traveling salesman problem. J. Algorithms 5(1984), pp. 231-246.
18. B. Raghavachari. Algorithms for finding low degree structures. In [9]
19. 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.