Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
A network-flow technique for finding low-weight bounded-degree spanning trees
Journal of Algorithms
Algorithms for area-efficient orthogonal drawings
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Low-Degree Spanning Trees of Small Weight
SIAM Journal on Computing
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Euclidean Bounded-Degree Spanning Tree Ratios
Discrete & Computational Geometry
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
Technical Section: Visibility of noisy point cloud data
Computers and Graphics
Strong connectivity in sensor networks with given number of directional antennae of bounded angle
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Polynomial area bounds for MST embeddings of trees
Computational Geometry: Theory and Applications
On the area requirements of Euclidean minimum spanning trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the area requirements of Euclidean minimum spanning trees
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We show that it is an NP-hard problem to decide for a given set P of n points in the Euclidean plane and a given parameter k∈R, whether P admits a spanning tree of maximum vertex degree four whose sum of edge lengths does not exceed k.