Sciweavers

217 search results - page 2 / 44
» Low Distortion Spanners
Sort
View
ICALP
2010
Springer
13 years 10 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
TIT
2010
107views Education» more  TIT 2010»
12 years 12 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
FOCS
2008
IEEE
13 years 11 months ago
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
Yefim Dinitz, Michael Elkin, Shay Solomon
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
13 years 9 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
DCG
2010
84views more  DCG 2010»
13 years 5 months ago
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
Yefim Dinitz, Michael Elkin, Shay Solomon