Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs

  • Ken-ichi Kawarabayashi
  • Philip N. Klein
  • Christian Sommer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6755)


A (1 + ε)–approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and preprocessing time.

There are strong distance-oracle constructions known for planar graphs (Thorup, JACM’04) and, subsequently, minor-excluded graphs (Abraham and Gavoille, PODC’06). However, these require \(\Omega(\epsilon^{-1} n \lg n)\) space for n–node graphs.

In this paper, for planar graphs, bounded-genus graphs, and minor-excluded graphs we give distance-oracle constructions that require only O(n) space. The big O hides only a fixed constant, independent of ε and independent of genus or size of an excluded minor. The preprocessing times for our distance oracle are also faster than those for the previously known constructions. For planar graphs, the preprocessing time is \(O(n \lg^2 n)\). However, our constructions have slower query times. For planar graphs, the query time is \(O(\epsilon^{-2} \lg^2 n)\).

For all our linear-space results, we can in fact ensure, for any δ > 0, that the space required is only 1 + δ times the space required just to represent the graph itself.


Short Path Planar Graph Boundary Node Query Time Sparse Graph 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ABH+04]
    Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: Proceedings of the Fifteenth ACM-SIAM Symposium on Discrete Algorithms, pp. 531–540 (2004)Google Scholar
  2. [AG06]
    Abraham, I., Gavoille, C.: Object location using path separators. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 188–197 (2006); Details in LaBRI Research Report RR-1394-06Google Scholar
  3. [AHdLT05]
    Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms 1(2), 243–264 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [BGK+10]
    Bartal, Y., Gottlieb, L.-A., Kopelowitz, T., Lewenstein, M., Roditty, L.: Fast, precise and dynamic distance queries. CoRR, abs/1008.1480 (2010) (to appear in SODA 2011)Google Scholar
  5. [Cab06]
    Cabello, S.: Many distances in planar graphs. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1213–1220 (2006); a preprint of the journal version is available in the University of Ljubljana preprint series, vol. 47, p. 1089 (2009)Google Scholar
  6. [CC07]
    Cabello, S., Chambers, E.W.: Multiple source shortest paths in a genus g graph. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, pp. 89–97 (2007)Google Scholar
  7. [CX00]
    Chen, D.Z., Xu, J.: Shortest path queries in planar graphs. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 469–478 (2000)Google Scholar
  8. [DPZ00]
    Djidjev, H., Pantziou, G.E., Zaroliagis, C.D.: Improved algorithms for dynamic shortest paths. Algorithmica 28(4), 367–389 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  9. [Epp03]
    Eppstein, D.: Dynamic generators of topologically embedded graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 599–608 (2003)Google Scholar
  10. [FR06]
    Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. Journal of Computer and System Sciences 72(5), 868–889 (2006), announced at FOCS 2001MathSciNetCrossRefzbMATHGoogle Scholar
  11. [Fre87]
    Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing 16(6), 1004–1022 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  12. [Fre97]
    Frederickson, G.N.: A data structure for dynamically maintaining rooted trees. Journal of Algorithms 24, 37–65 (1997), announced at SODA 1993MathSciNetCrossRefzbMATHGoogle Scholar
  13. [HKRS97]
    Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences 55(1), 3–23 (1997), announced at STOC 1994MathSciNetCrossRefzbMATHGoogle Scholar
  14. [HPM06]
    Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. SIAM J. Comput. 35(5), 1148–1184 (2006), announced at SOCG 2005MathSciNetCrossRefzbMATHGoogle Scholar
  15. [KK06]
    Kowalik, L., Kurowski, M.: Oracles for bounded-length shortest paths in planar graphs. ACM Transactions on Algorithms 2(3), 335–363 (2006), announced at STOC 2003MathSciNetCrossRefzbMATHGoogle Scholar
  16. [KKS11]
    Kawarabayashi, K., Klein, P.N., Sommer, C.: Linear-space approximate distance oracles for planar, bounded-genus, and minor-free graphs. CoRR, abs/1104.5214 (2011)Google Scholar
  17. [Kle05]
    Klein, P.N.: Multiple-source shortest paths in planar graphs. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 146–155 (2005)Google Scholar
  18. [KMW10]
    Klein, P.N., Mozes, S., Weimann, O.: Shortest paths in directed planar graphs with negative lengths: A linear-space O(nlog2n)-time algorithm. ACM Transactions on Algorithms 6(2) (2010), announced at SODA 2009Google Scholar
  19. [LT79]
    Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36(2), 177–189 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  20. [MS10]
    Mozes, S., Sommer, C.: Exact distance oracles for planar graphs. CoRR, abs/1011.5549 (2010)Google Scholar
  21. [MWN10]
    Mozes, S., Wulff-Nilsen, C.: Shortest paths in planar graphs with real lengths in O(nlog2 n/loglogn) time. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6347, pp. 206–217. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  22. [MZ07]
    Muller, L.F., Zachariasen, M.: Fast and compact oracles for approximate distances in planar graphs. In: Proceedings of the 15th Annual European Conference on Algorithms, pp. 657–668 (2007)Google Scholar
  23. [Nus10]
    Nussbaum, Y.: Improved distance queries in planar graphs. CoRR, abs/1012.2825 (2010)Google Scholar
  24. [PR10]
    Patrascu, M., Roditty, L.: Distance oracles beyond the Thorup–Zwick bound. In: 51st Annual IEEE Symposium on Foundations of Computer Science, FOCS (2010)Google Scholar
  25. [Sli07]
    Slivkins, A.: Distance estimation and object location via rings of neighbors. Distributed Computing 19(4), 313–333 (2007), announced at PODC 2005CrossRefzbMATHGoogle Scholar
  26. [ST83]
    Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26(3), 362–391 (1983), announced at STOC 1981MathSciNetCrossRefzbMATHGoogle Scholar
  27. [SVY09]
    Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 703–712 (2009)Google Scholar
  28. [Tal04]
    Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 281–290 (2004)Google Scholar
  29. [Tho99]
    Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM 46(3), 362–394 (1999), announced at FOCS 1997MathSciNetCrossRefzbMATHGoogle Scholar
  30. [Tho00]
    Thorup, M.: Floats, integers, and single source shortest paths. Journal of Algorithms 35(2), 189–201 (2000), announced at STACS 1998MathSciNetCrossRefzbMATHGoogle Scholar
  31. [Tho04]
    Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM 51(6), 993–1024 (2004), announced at FOCS 2001MathSciNetCrossRefzbMATHGoogle Scholar
  32. [TW05]
    Tarjan, R.E., Werneck, R.F.F.: Self-adjusting top trees. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 813–822 (2005)Google Scholar
  33. [TZ05]
    Thorup, M., Zwick, U.: Approximate distance oracles. Journal of the ACM 52(1), 1–24 (2005), announced at STOC 2001MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ken-ichi Kawarabayashi
    • 1
  • Philip N. Klein
    • 2
  • Christian Sommer
    • 3
  1. 1.NIITokyoJapan
  2. 2.Brown UUSA
  3. 3.MITCambridgeUSA

Personalised recommendations