A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees

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.