Login / Signup

Computing a minimum-dilation spanning tree is NP-hard.

Otfried CheongHerman J. HaverkortMira Lee
Published in: Comput. Geom. (2008)
Keyphrases