Computing Geometric Minimum-Dilation Graphs is NP-Hard

Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx. Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geometry Appl., 20(2):147-173, 2010. [doi]

Abstract

Abstract is missing.