A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
Author(s)Badoiu, Mihai; Indyk, Piotr; Sidiropoulos, Anastasios
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.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
AI, embeddings, approximation algorithms, trees