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]

Authors

Panos Giannopoulos

This author has not been identified. Look up 'Panos Giannopoulos' in Google

Rolf Klein

This author has not been identified. Look up 'Rolf Klein' in Google

Christian Knauer

This author has not been identified. Look up 'Christian Knauer' in Google

Martin Kutz

This author has not been identified. Look up 'Martin Kutz' in Google

Dániel Marx

This author has not been identified. Look up 'Dániel Marx' in Google