Name
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 t1, both whether planarity of the t-spanner is required or not. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jda.2013.06.010 | Journal of Discrete Algorithms |
Keywords | DocType | Volume |
constant factor,total length,euclidean distance,euclidean t-spanner,real constant t1,geometric graph,set p,minimum weight euclidean t-spanner,computational geometry | Journal | 22, |
ISSN | Citations | PageRank |
1570-8667 | 0 | 0.34 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paz Carmi | 1 | 321 | 43.14 |
| Lilach Chaitman-Yerushalmi | 2 | 16 | 4.72 |