Computing a minimum-dilation spanning tree is NP-hard

Authors:
Otfried Cheong;Herman Haverkort;Mira Lee
Affiliations:
Korea Advanced Institute of Science & Technology, Daejeon, South Korea;TU Eindhoven, Eindhoven, the Netherlands;Korea Advanced Institute of Science & Technology, Daejeon, South Korea
Venue:
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Year:
2007

Citing 6
Cited 6

A sparse graph almost as good as the complete graph on points in K dimensions

Discrete & Computational Geometry
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
Computing geometric minimum-dilation graphs is NP-hard

GD'06 Proceedings of the 14th international conference on Graph drawing
On spanners of geometric graphs

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Experimental study of geometric t-spanners

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Sparse geometric graphs with small dilation

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Sparse geometric graphs with small dilation

Computational Geometry: Theory and Applications
Optimal Embedding into Star Metrics

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics

INFOCOM'10 Proceedings of the 29th conference on Information communications
Near-optimal multicriteria spanner constructions in wireless ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics

ACM Transactions on Sensor Networks (TOSN)
Approximated algorithms for the minimum dilation triangulation problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation δ 1, it is NP-hard to determine whether a spanning tree of S with dilation at most δ exists.