Abstract
Low distortion probabilistic embedding of graphs into approximating trees is an extensively studied topic. Of particular interest is the case where the approximating trees are required to be (subgraph) spanning trees of the given graph (or multigraph), in which case, the focus is usually on the equivalent problem of finding a (single) tree with low average stretch. Among the classes of graphs that received special attention in this context are k-outerplanar graphs (for a fixed k): Chekuri, Gupta, Newman, Rabinovich, and Sinclair show that every k-outerplanar graph can be probabilistically embedded into approximating trees with constant distortion regardless of the size of the graph. The approximating trees in the technique of Chekuri et al. are not necessarily spanning trees, though.
In this paper it is shown that every k-outerplanar multigraph admits a spanning tree with constant average stretch. This immediately translates to a constant bound on the distortion of probabilistically embedding k-outerplanar graphs into their spanning trees. Moreover, a randomized algorithm is presented for constructing such a low average stretch spanning tree in expected linear time. This algorithm relies on some new insights regarding the connection between low average stretch spanning trees and planar duality.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: 49th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 781–790 (2008)
Alon, N., Karp, R.M., Peleg, D., West, D.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24, 78–100 (1995)
Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: 37th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 184–193 (1996)
Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: 30th ACM Symp. on the Theory of Computing (STOC), pp. 161–168 (1998)
Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.A.: Approximating a finite metric by a small number of tree metrics. In: 39th Symp. on Foundations of Computer Science (FOCS), pp. 379–388 (1998)
Chekuri, C., Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Embedding k-outerplanar graphs into ℓ1. SIAM J. Discrete Math. 20(1), 119–136 (2006)
Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. SIAM J. Comput. 38(2), 608–628 (2008)
Emek, Y.: k-Outerplanar graphs, planar duality, and low stretch spanning trees, http://www.eng.tau.ac.il/~yuvale/Publications/k-outerplanar.pdf
Emek, Y., Peleg, D.: A tight upper bound on the probabilistic embedding of series-parallel graphs. In: 17th ACM-SIAM Symp. on Discrete algorithm (SODA), pp. 1045–1053 (2006)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485–497 (2004)
Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and ℓ1-embeddings of graphs. Combinatorica 24(2), 233–269 (2004)
Hu, T.C.: Optimum communication spanning trees. SIAM J. Comput. 3, 188–195 (1974)
Indyk, P., Sidiropoulos, A.: Probabilistic embeddings of bounded genus graphs into planar graphs. In: 23rd ACM Symp. on Computational Geometry (SoCG), pp. 204–209 (2007)
Klein, P.N., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: 25th ACM Symp. on Theory of Computing (STOC), pp. 682–690 (1993)
Konjevod, G., Ravi, R., Salman, F.S.: On approximating planar metrics by tree metrics. Inf. Process. Lett. 80(4), 213–219 (2001)
Whitney, H.: On the abstract properties of linear dependence. Amer. J. Math. 57, 509–533 (1935)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emek, Y. (2009). k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)