Sciweavers

Share
CATS
2007

Computing a Minimum-Dilation Spanning Tree is NP-hard

9 years 5 months ago
Computing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation 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.
Otfried Cheong, Herman J. Haverkort, Mira Lee
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where CATS
Authors Otfried Cheong, Herman J. Haverkort, Mira Lee
Comments (0)
books