Approximation Algorithms for Minimizing Average Distortion

This paper considers embeddings f of arbitrary finite metrics into the line metric ℜ so that none of the distances is shrunk by the embedding f; the quantity of interest is the factor by which the average distance in the metric is stretched. We call this quantity the average distortion of the non-contracting map f. We prove that finding the best embedding of even a tree metric into a line metric to minimize the average distortion is NP-hard, and hence focus on approximating the average distortion of the best possible embedding for the given input metric. We give a constant-factor approximation for the problem of embedding general metrics into the line metric. For the case of n-point tree metrics, we provide a quasi-polynomial time approximation scheme which outputs an embedding with distortion at most (1 + e) times the optimum in time nO(log n/e^2). Finally, when the average distortion is measured only over the endpoints of the edges of an input tree metric, we show how to exploit the structure of tree metrics to give an exact solution in polynomial time.

[1]  Satish Rao,et al.  The k-traveling repairman problem , 2003, SODA '03.

[2]  Yossi Shiloach,et al.  A Minimum Linear Arrangement Algorithm for Undirected Trees , 1979, SIAM J. Comput..

[3]  Noga Alon,et al.  A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[4]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[5]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 2002, JACM.

[6]  Satish Rao,et al.  New approximation techniques for some ordering problems , 1998, SODA '98.

[7]  Richard T. Wong,et al.  Worst-Case Analysis of Network Design Problem Heuristics , 1980, SIAM J. Algebraic Discret. Methods.

[8]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[9]  Frank Harary,et al.  Distance in graphs , 1990 .

[10]  René Sitters,et al.  The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.

[11]  Anupam Gupta,et al.  Steiner points in tree metrics don't (really) help , 2001, SODA '01.

[12]  Santosh S. Vempala,et al.  Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems , 2000, Theor. Comput. Sci..

[13]  Yuval Rabani,et al.  Approximation algorithms for the 0-extension problem , 2001, SODA '01.

[14]  Yuval Rabani,et al.  Low distortion maps between point sets , 2004, STOC '04.

[15]  Mikkel Thorup,et al.  On the approximability of numerical taxonomy (fitting distances by tree metrics) , 1996, SODA '96.

[16]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[17]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[18]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[19]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[20]  Sanjeev Arora,et al.  Approximation Schemes for Minimum Latency Problems , 2003, SIAM J. Comput..

[21]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[22]  Andrew Tomkins,et al.  A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.

[23]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[24]  J. Matousek,et al.  Bi-Lipschitz embeddings into low-dimensional Euclidean spaces , 1990 .

[25]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[26]  David P. Williamson,et al.  Faster approximation algorithms for the minimum latency problem , 2003, SODA '03.

[27]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[28]  Ran Raz,et al.  Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs , 1998, Discret. Comput. Geom..

[29]  Yuri Rabinovich.  On average distortion of embedding metrics into the line and into L1 , 2003, STOC '03.

[30]  I. Bárány.  LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .

[31]  Uriel Feige,et al.  Approximating the bandwidth via volume respecting embeddings (extended abstract) , 1998, STOC '98.

[32]  Kunal Talwar,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2004, J. Comput. Syst. Sci..

[33]  Satish Rao,et al.  Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[34]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[35]  Uriel Feige,et al.  Approximating the Bandwidth via Volume Respecting Embeddings , 2000, J. Comput. Syst. Sci..

[36]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .