Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Badoiu, Mihai
dc.contributor.author Indyk, Piotr
dc.contributor.author Sidiropoulos, Anastasios
dc.date.accessioned 2005-12-22T01:35:27Z
dc.date.available 2005-12-22T01:35:27Z
dc.date.issued 2004-07-05
dc.identifier.other MIT-CSAIL-TR-2004-045
dc.identifier.other AIM-2004-015
dc.identifier.uri http://hdl.handle.net/1721.1/30484
dc.description.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.
dc.format.extent 8 p.
dc.format.extent 6685848 bytes
dc.format.extent 331083 bytes
dc.format.mimetype application/postscript
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subject AI
dc.subject embeddings
dc.subject approximation algorithms
dc.subject trees
dc.title A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees


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)

Show simple item record

MIT-Mirage