47 search results - page 5 / 10 » A tight bound on approximating arbitrary metrics by tree met... |
TALG
2008
13 years 9 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
ALGORITHMICA
2002
13 years 9 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
PDCAT
2005
Springer
14 years 3 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
IPCO
2001
13 years 11 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...