Computing Geometric Minimum-Dilation Graphs Is NP-Hard

Abstract

Abstract. Consider a geometric graph G, drawn with straight lines in the plane. For every pair a, b of vertices of G, we compare the shortestpath distance between a and b in G (with Euclidean edge lengths) to their actual Euclidean distance in the plane. The worst-case ratio of these two values, for all pairs of vertices, is called the vertex-to-vertex dilation of G.We prove that computing a minimum-dilation graph that connects a given n-point set in the plane, using not more than a given number m of edges, is an NP-hard problem, no matter if edge crossings are allowed or forbidden. In addition, we show that the minimum dilation tree over a given point set may in fact contain edge crossings.

Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics

“…Some of the works try to satisfy two or more of these properties at the same time. The NP-hardness of the problem has been addressed [Gudmundsson and Smid 2006;Klein and Kutz 2006;Cheong et al 2007;Lloyd 1977]. The results can be roughly divided into two categories, geometric graphs and general graphs.…”

On plane geometric spanners: A survey and open problems

“…The complexity of the problem is unknown, however, there is strong evidence to suggest that the problem is NPhard. Recently, Klein and Kutz [45] showed that computing, when given a point set and a real number t > 1, the t-spanner with the minimum number of edges is NP-hard. In fact, Cheong et al [23] showed that even computing the spanning tree with minimum spanning ratio of a given point set is an NP-hard problem.…”

Minimum weight Euclidean t -spanner is NP-hard

“…The Partition problem: Input: A set X = {x 1 , ..., x n } of n positive integers with even x∈X x = R. Output: Whether there exists a subset X ⊂ X such that x∈X x = R/2. [9] have proved that the Dilation Graph and the Plane Dilation Graph problems are NP-hard by a reduction from the Partition problem as well. The Dilation Graph problem (resp.…”