A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
Author(s)Badoiu, Mihai; Indyk, Piotr; Sidiropoulos, Anastasios
MetadataShow full item record
We present a constant-factor approximation algorithm for computing an embedding of the shortest path metric of an unweighted graph into a tree, that minimizes the multiplicative distortion.
AI, embeddings, approximation algorithms, trees