On approximating planar metrics by tree metrics

We combine the results of Bartal [Proc. 37th FOCS, 1996, pp. 184–193] on probabilistic approximation of metric spaces by tree metrics, with those of Klein, Plotkin and Rao [Proc. 25th STOC, 1993, pp. 682–690] on decompositions of graphs without small Ks,s minors (such as planar graphs) to show that metrics induced by such graphs (with unit lengths on the edges) can be probabilistically approximated by tree metrics with an O(log diam G) distortion. This improves upon Bartal’s result that holds for general n-node metrics with a distortion of O(log n log log n). The main ingredient of our proof is that weak probabilistic partitions suffice for the construction of tree metrics with low distortion, in contrast to strong partitions used by Bartal. We also show that our result is the best possible by providing a lower bound of �( log diam G) for the distortion of any probabilistic approximation of the square grid by tree metrics.  2001 Elsevier Science B.V. All rights reserved.

[1]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

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

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

[4]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[5]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

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

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

[8]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Tao Jiang,et al.  Aligning sequences via an evolutionary tree: complexity and approximation , 1994, STOC '94.

[10]  R. Graham,et al.  On isometric embeddings of graphs , 1985 .

[11]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[12]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[13]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[14]  Chuan Yi Tang,et al.  A polynomial time approximation scheme for minimum routing cost spanning trees , 1998, SODA '98.

[15]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[16]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.