scientific article; zbMATH DE number 5734722

zbMATH Open1204.90114MaRDI QIDQ3574261FDOQ3574261

Authors Moritz Hilger, Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling 

Publication date 9 July 2010

zbMATH Keywords

centralized shortest path algorithmmulti-way arc separators

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Experimental and Efficient Algorithms
• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
• Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
• Efficient computation of geodesic shortest paths
• On finding shortest paths in arc-dependent networks
• Point-to-Point Shortest Path Algorithms with Preprocessing
• An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
• Speed-Up Techniques for Shortest-Path Computations
• Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks

Cited In (22)

• Candidate sets for alternative routes in road networks
• An exact combinatorial algorithm for minimum graph bisection
• Arc-flags in dynamic graphs
• Fully dynamic update of arc-flags
• A novel pseudo‐polynomial approach for shortest path problems
• Exact distance oracles for planar graphs
• Time-dependent SHARC-routing
• Partitioning graphs to speedup Dijkstra's algorithm
• Real-time traffic assignment using engineered customizable contraction hierarchies
• An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags
• Point-to-Point Shortest Path Algorithms with Preprocessing
• Regarding goal bounding and jump point search
• Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
• Algorithms for searching paths in huge graphs
• Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
• On the complexity of partitioning graphs for arc-flags
• Time-Dependent SHARC-Routing
• Fission: Practical algorithms for computing minimum balanced node separators
• Traffic Networks and Flows over Time
• Applying skeletons to speed up the Arc-Flags routing algorithm
• On the complexity of partitioning graphs for arc-flags
• Reach for \(A^\ast\): efficient point-to-point shortest path algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574261)