The Euclidean degree-4 minimum spanning tree problem is NP-hard

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2009, Pages 179-188

  Francke, Andrea ^a   Hoffmann, Michael ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Bounded degree graphs; Degree constricted graphs; Degree restricted graphs; Geometric graphs; Geometric optimization; NP complete; Reduction; Spanning trees

Indexed keywords

BOUNDED DEGREE GRAPHS; GEOMETRIC GRAPHS; GEOMETRIC OPTIMIZATION; NP COMPLETE; SPANNING TREE;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY;

GRAPH THEORY;

EID: 70849124897     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542362.1542399     Document Type: Conference Paper

References (18)

1. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci., pages 2-11, 1996.
2. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753-782, 1998.
3. S. Arora and K. Chang. Approximation schemes for degree-restricted MST and red-blue separation problems. Algorithmica, 40(3):189-210, 2004.
4. T. M. Chan. Euclidean bounded-degree spanning tree ratios. Discrete Comput. Geom., 32(2):177-194, 2004.
5. E. D. Demaine, J. S. B. Mitchell, and J. O'Rourke. The Open Problems Project. http://maven.smith.edu/orourke/TOPP/.
6. S. P. Fekete. Problem 48: Bounded-degree minimum Euclidean spanning tree. http://maven.smith.edu/orourke/TOPP/P48.html.
7. S. P. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, and N. Young. A network-flow technique for finding low-weight bounded-degree spanning trees. J. Algorithms, 24(2):310-324, 1997.
8. M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math., 32:826-834, 1977.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
10. R. Jothi and B. Raghavachari. Degree-bounded minimum spanning trees. Discrete Appl. Math., 157(5):960-970, 2009.
11. S. Khuller, B. Raghavachari, and N. Young. Low-degree spanning trees of small weight. SIAM J. Comput., 25(2):355-368, 1996.
12. 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.
13. C. Monma and S. Suri. Transitions in geometric minimum spanning trees. Discrete Comput. Geom., 8(3):265-293, 1992.
14. C. H. Papadimitriou. The Euclidean traveling salesman problem is NP-complete. Theoret. Comput. Sci., 4:237-244, 1977.
15. C. H. Papadimitriou and U. V. Vazirani. On two geometric problems related to the travelling salesman problem. J. Algorithms, 5:231-246, 1984.
16. A. Papakostas and I. G. Tollis. Algorithms for area-efficient orthogonal drawings. Comput. Geom. Theory Appl., 9(1-2):83-110, 1998.
17. G. Robins and J. S. Salowe. Low-degree minimum spanning trees. Discrete Comput. Geom., 14(2):151-165, 1995.
18. R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230-1234, 1989.