@inbook{cf94084392e94c8a8c8ebbb173888c0f,

title = "Approximation algorithms for minimizing average distortion",

abstract = "We study the problem of embedding arbitrary finite metrics into a line metric in a non-contracting fashion to approximate the minimum average distortion. Since a path metric (or a line metric) is quite restricted, these embeddings could have high average distortions (Ω(n), where n is the number of points in the original metric). Furthermore, we prove that finding best embedding of even a tree metric into a line to minimize average distortion is NP-hard. Hence, we focus on approximating the best possible embedding for given input metric. We give a constant-factor approximation for the problem of embedding general metrics into the line metric. For the case of the metrics which can be represented as trees, we provide improved approximation ratios in polynomial time as well as a QPTAS (Quasi-Polynomial Time Approximation Scheme).",

author = "Kedar Dhamdhere and Anupam Gupta and R. Ravi",

year = "2004",

doi = "10.1007/978-3-540-24749-4_21",

language = "English (US)",

isbn = "9783540212362",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "234--245",

editor = "Volker Diekert and Michel Habib",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}