15 search results - page 2 / 3 » Approximating the Stretch Factor of Euclidean Graphs |
WG
2010
Springer
13 years 3 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
CCCG
2009
13 years 6 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
DCOSS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ESA
2009
Springer
13 years 9 months ago
2009
Springer
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...