Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
We present a constant-factor approximation algorithm for computing anembedding of the shortest path metric of an unweighted graph into atree, that minimizes the multiplicative distortion.
