Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces
Name
17m1113527.pdf
Description
Published version
Size
423.34 KB
Format
Adobe PDF
Checksum (MD5)
99e117fd9394124f20cadbda92dd63ad
Author(s)
Sidiropoulos, Anastasios
Badoiu, Mihai
Dhamdhere, Kedar
Gupta, Anupam
Indyk, Piotr
Rabinovich, Yuri
Racke, Harald
Ravi, R
Date Issued
2019
Journal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/17M1113527
