Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces

Author(s)
Sidiropoulos, Anastasios; Badoiu, Mihai; Dhamdhere, Kedar; Gupta, Anupam; Indyk, Piotr; ... Show more
Thumbnail
DownloadPublished version (423.3Kb)
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
© 2019 Society for Industrial and Applied Mathematics We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the 2-dimensional plane. Among other results, we give an O(n)approximation algorithm for the problem of finding a line embedding of a metric induced by a given unweighted graph, that minimizes the (standard) multiplicative distortion. We give an improved Õ(n1/3) approximation for the case of metrics induced by unweighted trees.
Date issued
2019
URI
https://hdl.handle.net/1721.1/135060
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Collections