Euclidean bounded-degree spanning tree ratios

Discrete and Computational Geometry

Volumn 32, Issue 2, 2004, Pages 177-194

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4344634500     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1117-3     Document Type: Conference Paper

References (20)

1. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. Assoc. Comput. Mach., 45:753-782, 1998.
2. S. Arora. Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Programming, 97:27-42, 2003.
3. S. Arora and K. C. Chang. Approximation schemes for degree-restricted MST and red-blue separation problem. In Proc. 13th Internat. Colloq. Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 2719, Springer-Verlag, Berlin, pages 176-188, 2003.
4. M. Bern and D. Eppstein. Approximation algorithms for geometric problems. In D. S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS, Boston, MA, pages 296-345, 1997.
5. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Tech. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1975.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (2nd edn.). McGraw-Hill, New York, 2001.
7. D.-Z. Du and F. K. Hwang. A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Algorithmica, 7:121-136, 1992.
8. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia (eds.), Handbook of Computational Geometry, Elsevier North-Holland, Amsterdam, pages 425-461, 2000.
9. S. P. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, and N. Young. A network-flow technique for finding low-weight bounded-degree trees. J. Algorithms, 24:310-324, 1997.
10. S. P. Fekete and H. Meijer. On minimum stars and maximum matchings. Discrete Comput. Geom., 23:389-407, 2000.
11. S. Khuller, B. Raghavachari, and N. Young. Low degree spanning trees of small weight. SIAM J. Comput., 25:355-368, 1996.
12. J. Könemann and R. Ravi. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In Proc. 32nd ACM Sympos. Theory of Computing, pages 537-546, 2000.
13. J. N. Lillington. Some extremal properties of convex sets. Math. Proc. Cambridge Philos. Soc., 77:515-524, 1975.
14. J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput., 28:1298-1309, 1999.
15. C. Monma and S. Suri. Transitions in geometric minimum spanning trees. Discrete Comput. Geom., 8:265-293, 1992.
16. C. H. Papadimitriou and U. V. Vazirani. On two geometric problems related to the traveling salesman problem. J. Algorithms, 5:231-246, 1984.
17. B. Raghavachari. Algorithms for finding low-degree structures. In D. S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS, Boston, MA, pages 266-295, 1997.
18. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III. Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica, 31:58-78, 2001.
19. G. Robins and J. S. Salowe. Low-degree minimum spanning trees. Discrete Comput. Geom., 14:151-165, 1995.
20. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis. An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput., 6:563-581, 1977.