Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Hierarchical optimization of optimal path finding for transportation applications
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Dynamic Algorithms for Shortest Paths in Planar Graphs
WG '91 Proceedings of the 17th International Workshop
On-Line Algorithms for Shortest Path Problems on Planar Digraphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Many distances in planar graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
SIAM Journal on Computing
Optimal branch-decomposition of planar graphs in O(n3) Time
ACM Transactions on Algorithms (TALG)
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
The Shortcut Problem --- Complexity and Approximation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ACM Transactions on Algorithms (TALG)
Distance Oracles for Sparse Graphs
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Shortest paths in planar graphs with real lengths in O(n log2n/ log log n) time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Distance Oracles beyond the Thorup-Zwick Bound
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Compact navigation and distance oracles for graphs with small treewidth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Preprocessing speed-up techniques is hard
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Approximate distance queries for weighted polyhedral surfaces
ESA'11 Proceedings of the 19th European conference on Algorithms
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Shortest path and distance queries on road networks: towards bridging theory and practice
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles. For any directed planar graph on n nodes with non-negative lengths we obtain the following: • Given a desired space allocation S ε [n lg lg n, n2], we show how to construct in Õ(S) time a data structure of size O(S) that answers distance queries in Õ(n/√ S) time per query. The best distance oracles for planar graphs until the current work are due to Cabello (SODA 2006), Chen and Xu (STOC 2000), Djidjev (WG 1996), and Fakcharoenphol and Rao (FOCS 2001). For σ ε (1, 4/3) and space S = nσ, we essentially improve the query time from n2/S to √n2/S. • As a consequence, we obtain an improvement over the fastest algorithm for k-many distances in planar graphs whenever k ε [√n, n). • We provide a linear-space exact distance oracle for planar graphs with query time O(n1/2+ε) for any constant ε 0. This is the first such data structure with provable sublinear query time. • For edge lengths ≥ 1, we provide an exact distance oracle of space Õ(n) such that for any pair of nodes at distance l the query time is Õ(min{l, √ n}). Comparable query performance had been observed experimentally but could not be explained theoretically. Our data structures with superlinear space are based on the following new tool: given a non-self-crossing cycle C with c = O(√n) nodes, we can preprocess G in Õ(n) time to produce a data structure of size O(n lg lg c) that can answer the following queries in Õ(c) time: for a query node u, output the distance from u to all the nodes of C. This data structure builds on and provides an alternative for a related data structure of Klein (SODA 2005), which reports distances to the boundary of a face, rather than a cycle.