The Euclidean degree-4 minimum spanning tree problem is NP-hard
Metadata only
Date
2009Type
- Conference Paper
ETH Bibliography
yes
Altmetrics
Publication status
publishedExternal links
Book title
Proceedings of the 25th annual symposium on Computational geometryPages / Article No.
Publisher
Association for Computing MachineryEvent
Subject
Geometric optimization; Spanning trees; Geometric graphs; Bounded degree graphs; Degree-restricted graphs; Degree-constricted graphs; Reduction; NP-completeMore
Show all metadata
ETH Bibliography
yes
Altmetrics