Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Fast Routing in Road Networks with Transit Nodes - MaRDI portal

Fast Routing in Road Networks with Transit Nodes

From MaRDI portal
Publication:3101693

DOI10.1126/science.1137521zbMath1226.90023OpenAlexW2083019227WikidataQ43913660 ScholiaQ43913660MaRDI QIDQ3101693

Dominik Schultes, Stefan Funke, Peter Sanders, Holger Bast

Publication date: 30 November 2011

Published in: Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1126/science.1137521




Related Items (23)

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub LabelsBidirectional A* search on time-dependent road networksA $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth GraphsFixed Parameter Approximations for k-Center Problems in Low Highway Dimension GraphsBidirectional A  ∗  Search for Time-Dependent Fast PathsRunning time analysis of ant colony optimization for shortest path problemsA simple ant colony optimizer for stochastic shortest path problemsA $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth GraphsOptimization of heuristic search using recursive algorithm selection and reinforcement learningBoosting the Exploration of Huge Dynamic GraphsThe compressed differential heuristicSublinear search spaces for shortest path planning in grid and road networksVC-Dimension and Shortest Path AlgorithmsTrue scale-invariant random spatial networksShortest-path queries in static networksTravelling on graphs with small highway dimensionEngineering Route Planning AlgorithmsCandidate Sets for Alternative Routes in Road NetworksUser-Constrained Multimodal Route PlanningCar or Public Transport—Two WorldsReal-time Traffic Assignment Using Engineered Customizable Contraction HierarchiesContraction Hierarchies: Faster and Simpler Hierarchical Routing in Road NetworksUnnamed Item




This page was built for publication: Fast Routing in Road Networks with Transit Nodes