Skip to main content
SpringerLink
Log in

k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees

  • Published:
Algorithmica Aims and scope Submit manuscript

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, an efficient randomized algorithm is presented for constructing such a low average stretch spanning tree. This algorithm relies on some new insights regarding the connection between low average stretch spanning trees and planar duality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: Proc. 49th IEEE Symp. on Foundations of Computer Science (FOCS), 2008

  2. 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)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)

    Article  MATH  Google Scholar 

  4. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc. 37th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 184–193 (1996)

  5. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proc. 30th ACM Symp. on the Theory of Computing (STOC), pp. 161–168 (1998)

  6. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.A.: Approximating a finite metric by a small number of tree metrics. In: Proc. 39th Symp. on Foundations of Computer Science (FOCS), pp. 379–388 (1998)

  7. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. SIAM J. Comput. 38(2), 608–628 (2008)

    Article  MathSciNet  Google Scholar 

  9. Emek, Y., Peleg, D.: A tight upper bound on the probabilistic embedding of series-parallel graphs. In: Proc. 17th ACM-SIAM Symp. on Discrete algorithm (SODA), pp. 1045–1053 (2006)

  10. 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)

    Article  MathSciNet  MATH  Google Scholar 

  11. Graham, R.L., Grötschel, M., Lovász, L. (eds.): Handbook of Combinatorics, vol. 1. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  12. Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and ℓ 1-embeddings of graphs. Combinatorica 24(2), 233–269 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Halin, R.: Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen. Math. Ann. 156(3), 216–225 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hu, T.C.: Optimum communication spanning trees. SIAM J. Comput. 3, 188–195 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  15. Indyk, P., Sidiropoulos, A.: Probabilistic embeddings of bounded genus graphs into planar graphs. In: Proc. 23rd ACM Symp. on Computational Geometry (SoCG), pp. 204–209 (2007)

  16. Klein, P.N., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proc. 25th ACM Symp. on Theory of Computing (STOC), pp. 682–690 (1993)

  17. Konjevod, G., Ravi, R., Salman, F.S.: On approximating planar metrics by tree metrics. Inf. Process. Lett. 80(4), 213–219 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Whitney, H.: On the abstract properties of linear dependence. Am. J. Math. 57, 509–533 (1935)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Israel R&D Center, Herzelia, Israel

    Yuval Emek

  2. School of Electrical Engineering, Tel Aviv University, Tel Aviv, Israel

    Yuval Emek

Authors
  1. Yuval Emek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuval Emek.

Additional information

Supported in part by the Israel Science Foundation, grants 221/07 and 664/05.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Emek, Y. k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. Algorithmica 61, 141–160 (2011). https://doi.org/10.1007/s00453-010-9423-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-010-9423-z

Keywords

Search

Navigation