Abstract
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 K s, 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(logdiam G) distortion. This improves upon Bartal's result that holds for general n-node metrics with a distortion of O(log nloglog 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 Ω( logdiamG) for the distortion of any probabilistic approximation of the square grid by tree metrics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
