Computing a minimum-dilation spanning tree is NP-hard

Otfried Cheong, Herman J. Haverkort, Mira Lee. Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom., 41(3):188-205, 2008. [doi]

Abstract

Abstract is missing.