A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
Author(s)
Badoiu, Mihai; Indyk, Piotr; Sidiropoulos, Anastasios
DownloadAIM-2004-015.ps (958.4Kb)
Additional downloads
Metadata
Show full item recordAbstract
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.
Date issued
2004-07-05Other identifiers
AIM-2004-015
Series/Report no.
AIM-2004-015
Keywords
AI, embeddings, approximation algorithms, trees