Sciweavers

Share
GD
2006
Springer

Computing Geometric Minimum-Dilation Graphs Is NP-Hard

8 years 10 months ago
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if edge crossings are allowed or forbidden. We also show that the problem remains NP-hard even when a minimum-dilation tour or path is sought; not even an FPTAS exists in this case.
Rolf Klein, Martin Kutz
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2006
Where GD
Authors Rolf Klein, Martin Kutz
Comments (0)
books