Engineering Route Planning Algorithms (Q3637315): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02094-0_7
+Normal rank
@@ Property / OpenAlex ID @@
+W2168148394
@@ Property / OpenAlex ID: W2168148394 / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering Label-Constrained Shortest-Path Algorithms
+Normal rank
@@ Property / cites work @@
+Fast Routing in Road Networks with Transit Nodes
@@ Property / cites work: Fast Routing in Road Networks with Transit Nodes / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum time-dependent travel times with contraction hierarchies
+Normal rank
@@ Property / cites work @@
+SHARC
@@ Property / cites work: SHARC / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest route through a network with time-dependent internodal transit times
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-Dependent SHARC-Routing
@@ Property / cites work: Time-Dependent SHARC-Routing / rank @@
+Normal rank
@@ Property / cites work @@
+Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
+Normal rank
@@ Property / cites work @@
+Q3574265
@@ Property / cites work: Q3574265 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs, negative weight edges, shortest paths, and near linear time
+Normal rank
@@ Property / cites work @@
+Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
+Normal rank
@@ Property / cites work @@
+Q2921666
@@ Property / cites work: Q2921666 / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering multilevel overlay graphs for shortest-path queries
+Normal rank
@@ Property / cites work @@
+Combining speed-up techniques for shortest-path computations
+Normal rank
@@ Property / cites work @@
+Q2921664
@@ Property / cites work: Q2921664 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
+Normal rank
@@ Property / cites work @@
+Q2768384
@@ Property / cites work: Q2768384 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs to speedup Dijkstra's algorithm
+Normal rank
@@ Property / cites work @@
+Fast and Compact Oracles for Approximate Distances in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Bidirectional A  ∗  Search for Time-Dependent Fast Paths
+Normal rank
@@ Property / cites work @@
+Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
+Normal rank
@@ Property / cites work @@
+Efficient models for timetable information in public transportation systems
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering Highway Hierarchies
@@ Property / cites work: Engineering Highway Hierarchies / rank @@
+Normal rank
@@ Property / cites work @@
+Dijkstra's algorithm on-line
@@ Property / cites work: Dijkstra's algorithm on-line / rank @@
+Normal rank
@@ Property / cites work @@
+Q4707785
@@ Property / cites work: Q4707785 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer priority queues with decrease key in constant time and the single source shortest paths problem
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric containers for efficient shortest-path computation
+Normal rank