## Exact Distance Oracles for Planar Graphs (2010)

### Cached

### Download Links

Citations: | 3 - 2 self |

### BibTeX

@MISC{Mozes10exactdistance,

author = {Shay Mozes and Christian Sommer},

title = {Exact Distance Oracles for Planar Graphs},

year = {2010}

}

### OpenURL

### Abstract

We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar graph G with non-negative arc lengths and for any ɛ> 0 there is a data structure that supports exact shortest path and distance queries in G with the following properties: the data structure can be created in time O(n lg(n) lg(1/ɛ)), the space required is O(n lg(1/ɛ)), and the query time is O(n 1/2+ɛ). Previous data structures by Fakcharoenphol and Rao (JCSS’06), Klein, Mozes, and Weimann (TransAlg’10), and Mozes and Wulff-Nilsen (ESA’10) with query time O(n 1/2 lg 2 n) use space at least Ω(n lg n / lg lg n). We also give a construction with a more general tradeoff. We prove that for any integer S ∈ [n lg n, n 2], we can construct in time Õ(S) a data structure of size O(S) that answers distance queries in O(nS −1/2 lg 2.5 n) time per query. Cabello (SODA’06) gave a comparable construction for the smaller range S ∈ [n 4/3 lg 1/3 n, n 2]. For the range S ∈ (n lg n, n 4/3 lg 1/3 n), only data structures of size O(S) with query time O(n 2 /S) had been known (Djidjev, WG’96). Combined, our results give the best query times for any shortest-path data structure for planar graphs with space S = o(n 4/3 lg 1/3 n). As a consequence, we also obtain an algorithm that computes k–many distances in planar graphs in time O((kn) 2/3 (lg n) 2 (lg lg n) −1/3 + n(lg n) 2 / lg lg n). 1

### Citations

591 | Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan |

375 | Graph minors ii: Algorithmic aspects of treewidth. Journal of Algorithms 7:309–322 - Roberston, Seymour - 1986 |

317 | Approximation algorithms for NP-complete problems on planar graphs - Baker - 1994 |

174 | Graph minors. X. Obstructions to treedecomposition
- Robertson, Seymour
- 1991
(Show Context)
Citation Context ...ost 3/4 the total weight. Proof. The algorithm computes a branch decomposition as in Gu and Tamaki [GT09, proof of Theorem 2]. It is known that branch-width and tree-width are within constant factors =-=[RS91]-=-. A branch decomposition [RS91] of a graph G is a ternary tree T whose leaves correspond to the edges of G. Removing any tree edge e ∈ T creates two connected components T1, T2 ⊆ T , each of which cor... |

168 | S.: Faster shortest-path algorithms for planar graphs
- Henzinger, Klein, et al.
- 1997
(Show Context)
Citation Context ...[WN10a] recently improved the space requirements to o(n2 ). If the space is restricted to linear, using the linear-time single-source shortest path algorithm of Henzinger, Klein, Rao, and Subramanian =-=[HKRS97]-=- is the fastest known for exact shortestpath queries until the current work (Theorem 1.3). Nussbaum [Nus11] has simultaneously obtained a result similar to Theorem 1.3. Efficient data structures for s... |

168 |
Efficient Algorithms for Shortest Path in Sparse Networks
- Johnson
(Show Context)
Citation Context ...) that answers distance queries in O(nS −1/2 lg 2 n lg 3/2 lg n) time per query. 2 Our results apply to graphs with negative-length edges by using reduced lengths induced by a feasible price function =-=[Joh77]-=-. The current best bound for computing a feasible price-function in a planar graph is O(n lg 2 n/ lg lg n) [MWN10]. 209 Copyright © SIAM. Unauthorized reproduction of this article is prohibited.As a ... |

124 | Fast algorithms for shortest paths in planar graphs, with applications - Frederickson - 1987 |

114 | Subgraph isomorphism in planar graphs and related problems - Eppstein |

94 | Call routing and the ratcatcher - Seymour, Thomas - 1994 |

88 | Diameter and treewidth in minor-closed graph families - Eppstein |

86 |
Compact oracles for reachability and approximate distances in planar digraphs
- Thorup
(Show Context)
Citation Context ... u to v be h = hG(u, v). At query time we use an approximate distance oracle to determine the right scale. In the preprocessing algorithm, we also precompute the approximate distance oracle of Thorup =-=[Tho04]-=- for ɛ = 1/2. This oracle can be computed in O(nɛ −1 lg 3 n) time, it uses space O(nɛ −1 lg n), and it answers (1 + ɛ)–approximate distance queries in time O(1/ɛ). If Assumption 6.1 holds, we instead ... |

82 |
Finding small simple cycle separators for 2-connected planar graphs
- Miller
- 1986
(Show Context)
Citation Context ...constant number of faces, called holes, such that every boundary node is incident to some hole. Such a decomposition can be found in O(n lg r+nr−1/2 lg n) [WN10b] by applying Miller’s cycle separator =-=[Mil86]-=- iteratively. We use this r–division recursively. Let the base of the recursion be level 0, and let the top of the recursion be level k. The entire graph G is defined to be the only piece at level k. ... |

73 | 2005) Highway hierarchies hasten exact shortest path queries - Sanders, Schultes |

60 | highest scoring paths in weighted grid graphs and its application to all approximate repeats in strings - Schmidt, All - 1998 |

56 | An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In Geoinformation und Mobilität – von der Forschung zur praktischen Anwendung, volume 22, pages 219–230. IfGI prints, Institut für Geoinformat - Lauther - 2004 |

53 | Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks - Geisberger, Sanders, et al. - 2008 |

51 | Planar graphs, negative weight edges, shortest paths, and near linear time
- Fakcharoenphol, Rao
(Show Context)
Citation Context ...ly any specified space requirement. Throughout the paper we assume the edge lengths to be non-negative. 2 Our results extend results of Cabello [Cab06], Chen and Xu [CX00], and Fakcharoenphol and Rao =-=[FR06]-=- and extend one result and improve upon another result of Djidjev [Dji96]. Consider Figure 1 for an illustration and comparison. Theorem 1.1. Let G be a directed planar graph on n vertices. For any va... |

49 |
Multiple-source shortest paths in planar graphs
- Klein
- 2005
(Show Context)
Citation Context ... main techniques we use are Frederickson’s r–division [Fre87], Fakcharoenphol and Rao’s implementation of Dijkstra’s algorithm [FR06], and Klein’s Multiple-Source Shortest Paths (MSSP) data structure =-=[Kle05]-=-, for which we propose a more space-efficient alternative (see Section 4 for a detailed comparison) as follows. Theorem 1.4. Given a directed planar graph G on n nodes and a simple cycle C with c = O(... |

43 |
Computing Point-to-Point Shortest Paths from External Memory
- Goldberg, Werneck
- 2005
(Show Context)
Citation Context ...e space requirements as small as possible [Zar08]. Low space consumption is obviously very important when a query algorithm is run on a system with heavily restricted memory such as a handheld device =-=[GW05]-=- but it is also important for systems with memory hierarchies [HMZ03, AT05], where caching effects can have a significant impact on the query time. While many road networks are actually not exactly pl... |

40 | Planar spanners and approximate shortest path queries among obstacles in the plane - Arikati, Chen, et al. - 1996 |

39 | Efficient exact algorithms for planar graphs: exploiting sphere cut branch decompositions - Dorn, Penninkx, et al. - 2005 |

35 | Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms
- CHAUDHURI, ZAROLIAGIS
- 2000
(Show Context)
Citation Context ...for Planar Graphs with Tree-width o( √ n). In this section we prove Theorem 6.1. There exist efficient distance oracles for (not necessarily planar) graphs with tree-width w. Chaudhuri and Zaroliagis =-=[CZ00]-=- provide a distance oracle that uses space O(w3n) and answers distance queries in time O(w3α(n)), where α(n) denotes the inverse Ackermann function. Farzan and Kamali [FK11] provide a distance oracle ... |

33 | Fast routing in road networks with transit nodes - Bast, Funke, et al. |

28 | S-functions for graphs - Halin - 1976 |

27 | Rundensteiner. ``Hierarchical Optimization of Optimal Path Finding for Transportation Applications
- Jing, Huang, et al.
- 1996
(Show Context)
Citation Context ...r of nodes n. nodes. Indeed, shortest-path query processing is an integral part of many applications [Som10], in particular in Geographic Information Systems (GIS), intelligent transportation systems =-=[JHR96]-=-. These systems may help individuals in finding fast routes or they may also assist companies in improving fleet management, plant and facility layout, and supply chain management. A particular challe... |

24 | An external memory data structure for shortest path queries - Hutchinson, Maheshwari, et al. - 1999 |

23 | Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm
- Klein, Mozes, et al.
(Show Context)
Citation Context ...y Fakcharoenphol and Rao [FR06]. Their data structure of space Õ(n) can be constructed in time Õ(n) and processes queries in time Õ(√n). The preprocessing time can be improved by a logarithmic factor =-=[KMW10]-=-. (Applications to distance oracles are not explicitly stated in [KMW10].) Some distance oracles have better query times. Djidjev [Dji96], improving upon earlier work of Feuerstein and Marchetti-Spacc... |

23 | Acceleration of Shortest Path and Constrained Shortest Path Computation - Köhler, Möhring, et al. - 2005 |

22 | Fast Point-to-Point Shortest Path Computations with Arc-Flags - Hilger, Köhler, et al. - 2009 |

20 | Arnborg and Andrzej Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees - Stefan |

19 | Highway dimension, shortest paths, and provably efficient algorithms - Abraham, Fiat, et al. - 2010 |

18 | Distance oracles for sparse graphs - Sommer, Verbin, et al. |

17 | Preprocessing an undirected planar network to enable fast approximate distance queries - KLEIN |

16 | Many distances in planar graphs
- Cabello
- 2012
(Show Context)
Citation Context ...own as distance oracles) for planar graphs for essentially any specified space requirement. Throughout the paper we assume the edge lengths to be non-negative. 2 Our results extend results of Cabello =-=[Cab06]-=-, Chen and Xu [CX00], and Fakcharoenphol and Rao [FR06] and extend one result and improve upon another result of Djidjev [Dji96]. Consider Figure 1 for an illustration and comparison. Theorem 1.1. Let... |

15 | Improved algorithms for dynamic shortest paths - Djidjev, Pantziou, et al. |

14 |
Dynamic algorithms for shortest paths in planar graphs
- Feuerstein, Marchetti-Spaccamela
- 1993
(Show Context)
Citation Context ...n in a planar graph is O(n lg 2 n/ lg lg n) [MWN10]. 209 Copyright © SIAM. Unauthorized reproduction of this article is prohibited.As a corollary, we obtain the following result on k– many distances =-=[FMS91]-=-, improving upon an algorithm of Cabello [Cab06], which runs in time Õ((kn)2/3 + n 4/3 ). Our result is an improvement for k = õ(n). For the range roughly k ∈ [ √ n, n), our algorithm is faster by a f... |

13 | Shortest paths in planar graphs with real lengths in O(n log2 n/ log logn) time
- Mozes, Wulff-Nilsen
- 2010
(Show Context)
Citation Context ...h negative-length edges by using reduced lengths induced by a feasible price function [Joh77]. The current best bound for computing a feasible price-function in a planar graph is O(n lg 2 n/ lg lg n) =-=[MWN10]-=-. 209 Copyright © SIAM. Unauthorized reproduction of this article is prohibited.As a corollary, we obtain the following result on k– many distances [FMS91], improving upon an algorithm of Cabello [Ca... |

12 | Distance oracles beyond the thorup-zwick bound - Patrascu, Roditty |

11 | Studying (Non-Planar) Road Networks Through an Algorithmic Lens - Eppstein, Goodrich |

9 | Shortest path queries in planar graphs - Chen, Xu - 2000 |

7 | VC-Dimension and Shortest Path Algorithms - Abraham, Delling, et al. |

7 | A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights - Klein |

6 |
On-Line Algorithms for Shortest Path Problems on Planar Digraphs
- Djidjev
- 1997
(Show Context)
Citation Context ...dge lengths to be non-negative. 2 Our results extend results of Cabello [Cab06], Chen and Xu [CX00], and Fakcharoenphol and Rao [FR06] and extend one result and improve upon another result of Djidjev =-=[Dji96]-=-. Consider Figure 1 for an illustration and comparison. Theorem 1.1. Let G be a directed planar graph on n vertices. For any value S in the range S ∈ [n lg lg n, n 2 ], there is a data structure with ... |

5 |
Min st-cut oracle for planar graphs with near-linear preprocessing time
- Borradaile, Sankowski, et al.
- 2013
(Show Context)
Citation Context ... in a planar graph between a set of nodes that lie on a constant number of faces. It does not rely on any other properties of the r–division. FR-Dijkstra can be extended to the following setting (cf. =-=[BSWN10]-=-). Let J be a planar graph. Let n ′ denote the number of nodes of J ∪ H. We can compute shortest paths in H ∪ J in O(|H| lg 2 |H| + n ′ lg n ′ ) time. The edges of H are relaxed using FR-Dijkstra, whi... |

5 | Preprocessing Speed-Up Techniques is Hard - Bauer, Columbus, et al. - 2010 |

5 | Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
- Kawarabayashi, Klein, et al.
- 2011
(Show Context)
Citation Context ... structure, assuming that storing the graph is free. It is known that, for approximate distances, a query algorithm can run efficiently using a data structure that occupies sublinear additional space =-=[KKS11]-=-. For exact distances and sublinear space, nothing better than the linear-time SSSP algorithm [HKRS97] is known. 6 Distance Oracles with Query Time Quasi-Proportional to the Shortest-Path Length We us... |

4 | Oracles for bounded-length shortest paths in planar graphs - Kowalik, Kurowski |

4 |
Approximate shortest path and distance queries in networks
- SOMMER
(Show Context)
Citation Context ...csom@csail.mit.edu 1 Asymptotic notation as in Õ(·) suppresses polylogarithmic factors in the number of nodes n. nodes. Indeed, shortest-path query processing is an integral part of many applications =-=[Som10]-=-, in particular in Geographic Information Systems (GIS), intelligent transportation systems [JHR96]. These systems may help individuals in finding fast routes or they may also assist companies in impr... |

3 |
Improved distance queries in planar graphs
- Nussbaum
(Show Context)
Citation Context ...ts as small as possible, i.e. linear in the size of the input. This is the first linear-space data structure with provably sublinear query time for exact pointto-point shortest-path queries. Nussbaum =-=[Nus11]-=- has simultaneously obtained a similar result. Theorem 1.3. For any directed planar graph G with non-negative arc lengths and for any constant ɛ > 0, there is a data structure that supports exact dist... |

2 | The Shortcut Problem – Complexity and Approximation - Bauer, D’Angelo, et al. - 2009 |