We consider embedding metrics induced by trees into Euclidean spaces with a restricted number of dimensions. We show that any weighted tree T with n vertices and L leaves can be embedded into d -dimensional Euclidean space with Õ (L 1/(d-1) ) distortion. Furthermore, we exhibit an embedding with almost the same distortion which can be computed efficiently. This distortion substantially improves the previous best upper bound of \tilde O (n 2/d ) and almost matches the best known lower bound of Ω(L 1/d )
We investigate the minimum value of D = D(n) such that any n-point tree metric space (T ; ae) can be...
Motivated by many recent algorithmic applications, this paper aims to promote a systematic study of ...
\u3cp\u3eThe METRIC EMBEDDING problem takes as input two metric spaces (X,DX) and (Y,DY), and a posi...
© 2019 Society for Industrial and Applied Mathematics We present several approximation algorithms fo...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
In computer science, when dealing with difficult problems involving graphs and their associated metr...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
This paper considers the problem of embedding trees into the hyperbolic plane. We show that any tree...
This paper considers the problem of embedding trees into the hyperbolic plane. We show that any tree...
Embedding between metric spaces is a very powerful algorithmic tool and has been used for finding go...
We investigate the minimum value of D = D(n) such that any n-point tree metric space (T ; ae) can be...
Motivated by many recent algorithmic applications, this paper aims to promote a systematic study of ...
\u3cp\u3eThe METRIC EMBEDDING problem takes as input two metric spaces (X,DX) and (Y,DY), and a posi...
© 2019 Society for Industrial and Applied Mathematics We present several approximation algorithms fo...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
In computer science, when dealing with difficult problems involving graphs and their associated metr...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical th...
This paper considers the problem of embedding trees into the hyperbolic plane. We show that any tree...
This paper considers the problem of embedding trees into the hyperbolic plane. We show that any tree...
Embedding between metric spaces is a very powerful algorithmic tool and has been used for finding go...
We investigate the minimum value of D = D(n) such that any n-point tree metric space (T ; ae) can be...
Motivated by many recent algorithmic applications, this paper aims to promote a systematic study of ...
\u3cp\u3eThe METRIC EMBEDDING problem takes as input two metric spaces (X,DX) and (Y,DY), and a posi...