Year: 2012
Type: preprint
Abstract: Given a set P of points in the plane, an Euclidean t-spanner for P is a geometric graph that preserves the Euclidean distances between every pair of points in P up to a constant factor t. The weight of a geometric graph refers to the total length of its edges. In this paper we show that the problem of deciding whether there exists an Euclidean t-spanner, for a given set of points in the plane, of weight at most w is NP-hard for every real constant t > 1, both whether planarity of the t-spanner is required or not.
Source: arXiv (Cornell University)
Authors: Carmi, Paz, Chaitman-Yerushalmi, Lilach
Institution: Ben-Gurion University of the Negev
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Israel Science Foundation
Award: G3472716809
OpenAlex ID: W2949656589