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.

• Type: Conference
• Year: 2007
• Where: CATS
• Authors: Otfried Cheong, Herman J. Haverkort, Mira Lee
• Keywords: Applied Computing, CATS 2007, Minimumdilation Spanning Tree, Smallest Possible Dilation