Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

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

Download
Author: Badoiu, Mihai; Indyk, Piotr; Sidiropoulos, Anastasios
Date Issued: 2004-07-05
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.
URI: http://hdl.handle.net/1721.1/30484
Other Identifiers: MIT-CSAIL-TR-2004-045
AIM-2004-015
Series/Report no.: Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Keywords: AI, embeddings, approximation algorithms, trees

Show full item metadata

Files in this item

Name Size Format Description
MIT-CSAIL-TR-2004 ... 6.376Mb Postscript

Files in this item

Name Size Format Description
MIT-CSAIL-TR-2004 ... 323.3Kb PDF

This item appears in the following Collection(s)

MIT-Mirage