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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/30484 |
| Date | 05 July 2004 |
| Creators | Badoiu, Mihai, Indyk, Piotr, Sidiropoulos, Anastasios |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 8 p., 6685848 bytes, 331083 bytes, application/postscript, application/pdf |
| Relation | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
Page generated in 0.0023 seconds