A separator theorem for graphs of bounded genus
Journal of Algorithms
Computational geometry: an introduction
Computational geometry: an introduction
Shortest paths in Euclidean graphs
Algorithmica
Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
BS*: an admissible bidirectional staged heuristic search algorithm
Artificial Intelligence
The GemStone object database management system
Communications of the ACM
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
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
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Communications of the ACM
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Knowledge and Data Engineering
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
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
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Journal of Algorithms
Iterative route planning for large-scale modular transportation simulations
Future Generation Computer Systems - Special issue: Geocomputation
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Roads, codes, and spatiotemporal queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
SIAM Journal on Computing
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
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)
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Graph clustering with network structure indices
Proceedings of the 24th international conference on Machine learning
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the Acceleration of Shortest Path Calculations in Transportation Networks
FCCM '07 Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Embedding metric spaces in their intrinsic dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Hyperbolic embedding of internet graph for distance estimation and overlay construction
IEEE/ACM Transactions on Networking (TON)
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proximity-preserving labeling schemes
Journal of Graph Theory
Algorithms and Data Structures: The Basic Toolbox
Algorithms and Data Structures: The Basic Toolbox
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
Point-to-Point Shortest Path Algorithms with Preprocessing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
SHARC: Fast and robust unidirectional routing
Journal of Experimental Algorithmics (JEA)
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Journal of the ACM (JACM)
Distance Oracles for Spatial Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Goal-directed shortest-path queries using precomputed cluster distances
Journal of Experimental Algorithmics (JEA)
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Algorithm Engineering --- An Attempt at a Definition
Efficient Algorithms
Car or Public Transport--Two Worlds
Efficient Algorithms
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Power-Law Distributions in Empirical Data
SIAM Review
Some studies in machine learning using the game of checkers
IBM Journal of Research and Development
Shortcut in the decomposition algorithm for shortest paths in a network
IBM Journal of Research and Development
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Path oracles for spatial networks
Proceedings of the VLDB Endowment
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
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
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Fast and compact oracles for approximate distances in planar graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces
INFOCOM'10 Proceedings of the 29th conference on Information communications
Orion: shortest path estimation for large social graphs
WOSN'10 Proceedings of the 3rd conference on Online social networks
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Distance Oracles beyond the Thorup-Zwick Bound
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Deciding First-Order Properties for Sparse Graphs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
SIAM Journal on Computing
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Causal reasoning on biological networks: interpreting transcriptional changes
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
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
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximate distance queries for weighted polyhedral surfaces
ESA'11 Proceedings of the 19th European conference on Algorithms
Graph Partitioning with Natural Cuts
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
On approximate distance labels and routing schemes with affine stretch
DISC'11 Proceedings of the 25th international conference on Distributed computing
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Approximate distance oracles with improved preprocessing time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Deterministic constructions of approximate distance oracles and spanners
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Scalable routing easy as PIE: A practical isometric embedding protocol
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Fast, precise and dynamic distance queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Many Distances in Planar Graphs
Algorithmica
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
Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Shortest paths in less than a millisecond
Proceedings of the 2012 ACM workshop on Workshop on online social networks
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A New Infinity of Distance Oracles for Sparse Graphs
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
On optimal preprocessing for contraction hierarchies
Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
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
Algorithms for hub label optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Search-Space size in contraction hierarchies
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We consider the point-to-point (approximate) shortest-path query problem, which is the following generalization of the classical single-source (SSSP) and all-pairs shortest-path (APSP) problems: we are first presented with a network (graph). A so-called preprocessing algorithm may compute certain information (a data structure or index) to prepare for the next phase. After this preprocessing step, applications may ask shortest-path or distance queries, which should be answered as fast as possible. Due to its many applications in areas such as transportation, networking, and social science, this problem has been considered by researchers from various communities (sometimes under different names): algorithm engineers construct fast route planning methods; database and information systems researchers investigate materialization tradeoffs, query processing on spatial networks, and reachability queries; and theoretical computer scientists analyze distance oracles and sparse spanners. Related problems are considered for compact routing and distance labeling schemes in networking and distributed computing and for metric embeddings in geometry as well. In this survey, we review selected approaches, algorithms, and results on shortest-path queries from these fields, with the main focus lying on the tradeoff between the index size and the query time. We survey methods for general graphs as well as specialized methods for restricted graph classes, in particular for those classes with arguable practical significance such as planar graphs and complex networks.