FOCS
2004
IEEE
14 years 7 months ago
2004
IEEE
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...
APPROX
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
APPROX
2007
Springer
14 years 9 months ago
2007
Springer
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
STOC
2004
ACM
15 years 3 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...