Data structures and network algorithms
Data structures and network algorithms
Shortest paths in Euclidean graphs
Algorithmica
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
BS*: an admissible bidirectional staged heuristic search algorithm
Artificial Intelligence
Introduction to algorithms
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
An Improved Bidirectional Heuristic Search Algorithm
Journal of the ACM (JACM)
Bidirectional Heuristic Search Again
Journal of the ACM (JACM)
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Fast exact and approximate geodesics on meshes
ACM SIGGRAPH 2005 Papers
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Proceedings of the 2006 ACM symposium on Applied computing
Using web-graph distance for relevance feedback in web search
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Program generation for the all-pairs shortest path problem
Proceedings of the 15th international conference on Parallel architectures and compilation techniques
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
Geodesic Gaussian kernels for value function approximation
Autonomous Robots
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
BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Combining heuristic and landmark search for path planning
Future Play '08 Proceedings of the 2008 Conference on Future Play: Research, Play, Share
Computers and Industrial Engineering
MLS-based scalar fields over triangle meshes and their application in mesh processing
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Monitoring path nearest neighbor in road networks
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)
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
On A☆ search with stopover areas
International Journal of Geographical Information Science
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
The M2M Pathfinding Algorithm Based on the Idea of Granular Computing
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Map-matching for low-sampling-rate GPS trajectories
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
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
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
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
Bidirectional A* search for time-dependent fast paths
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
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Shortest path computation on air indexes
Proceedings of the VLDB Endowment
Graph indexing of road networks for shortest path queries with label restrictions
Proceedings of the VLDB Endowment
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Computing the point-to-point shortest path: quotient space theory's application in complex network
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Mobile robots navigation based on graph search techniques
ECCE'10/ECCIE'10/ECME'10/ECC'10 Proceedings of the European conference of chemical engineering, and European conference of civil engineering, and European conference of mechanical engineering, and European conference on Control
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Neighborhood-privacy protected shortest distance computing in cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
Real-time diameter monitoring for time-evolving graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Optimization of heuristic search using recursive algorithm selection and reinforcement learning
Annals of Mathematics and Artificial Intelligence
Dynamic arc-flags in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Efficient centrality monitoring for time-evolving graphs
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Online computation of fastest path in time-dependent spatial networks
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Synthesizing routes for low sampling trajectories with absorbing Markov chains
WAIM'11 Proceedings of the 12th international conference on Web-age information management
ESA'11 Proceedings of the 19th European conference on Algorithms
Path queries on massive graphs based on multi-granular graph partitioning
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Context-aware nearest neighbor query on social networks
SocInfo'11 Proceedings of the Third international conference on Social informatics
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
Efficient data management in support of shortest-path computation
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Heuristic multiobjective search for hazmat transportation problems
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Multi-approximate-keyword routing in GIS data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Real-time routing with OpenStreetMap data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Goal directed shortest path queries using precomputed cluster distances
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Relational approach for shortest path discovery over large graphs
Proceedings of the VLDB Endowment
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Route planning with flexible edge restrictions
Journal of Experimental Algorithmics (JEA)
Shortest path and distance queries on road networks: an experimental evaluation
Proceedings of the VLDB Endowment
Multiobjective heuristic search in road maps
Expert Systems with Applications: An International Journal
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Partitioning graphs to speed up dijkstra's algorithm
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
An a* algorithm framework for the point-to-point time-dependent shortest path problem
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Routing with free geodata on mobile devices
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
Shortest path computation with no information leakage
Proceedings of the VLDB Endowment
A highway-centric labeling approach for answering distance queries on large sparse graphs
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
Spatial queries in wireless broadcast environments
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Core Routing on Dynamic Time-Dependent Road Networks
INFORMS Journal on Computing
Engineering highway hierarchies
Journal of Experimental Algorithmics (JEA)
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
Fully dynamic maintenance of arc-flags in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
A label correcting algorithm for the shortest path problem on a multi-modal route network
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Candidate sets for alternative routes in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Approximate shortest paths guided by a small index
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
A survey on proximity measures for social networks
Search Computing
Efficient route compression for hybrid route planning
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
BonnRoute: Algorithms and data structures for fast and good VLSI routing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Efficient breadth-first search on large graphs with skewed degree distributions
Proceedings of the 16th International Conference on Extending Database Technology
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
Outsourcing shortest distance computing with privacy protection
The VLDB Journal — The International Journal on Very Large Data Bases
Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem
ACM Transactions on Graphics (TOG)
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment
Journal of Intelligent and Robotic Systems
Routing directions: keeping it fast and simple
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A group based approach for path queries in road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Towards a Flexible and Scalable Fleet Management Service
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Optimizing Landmark-Based Routing and Preprocessing
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Nearest neighbor queries with service time constraints in time-dependent road networks
Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Information Sciences: an International Journal
Subset selection of search heuristics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based on landmarks and the triangle inequality. Our algorithms compute optimal shortest paths and work on any directed graph. We give experimental results showing that the most efficient of our new algorithms outperforms previous algorithms, in particular A* search with Euclidean bounds, by a wide margin on road networks and on some synthetic problem families.