Sciweavers

CATS
2007
13 years 6 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 ...
Otfried Cheong, Herman J. Haverkort, Mira Lee