The following pages link to Algorithms – ESA 2005 (Q5475866):
Displayed 22 items.
- Time-dependent SHARC-routing (Q547279) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- A new bidirectional search algorithm with shortened postprocessing (Q1026755) (← links)
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
- Mvtree for hierarchical network representation based on geometric algebra subspace (Q1659520) (← links)
- Uncertainties of sub-scaled supply and demand in agent-based mobility simulations with queuing traffic model (Q2129558) (← links)
- Fast paths in large-scale dynamic road networks (Q2268926) (← links)
- Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments (Q2288106) (← links)
- Energy-optimal routes for battery electric vehicles (Q2309482) (← links)
- Core Routing on Dynamic Time-Dependent Road Networks (Q2815439) (← links)
- User-Constrained Multimodal Route Planning (Q2828200) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks (Q3506418) (← links)
- Bidirectional A ∗ Search for Time-Dependent Fast Paths (Q3506419) (← links)
- Engineering Route Planning Algorithms (Q3637315) (← links)
- Traffic Networks and Flows over Time (Q3637317) (← links)
- Car or Public Transport—Two Worlds (Q3644732) (← links)
- Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies (Q4984867) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps (Q5391964) (← links)
- (Q5743390) (← links)
- A novel pseudo‐polynomial approach for shortest path problems (Q6087148) (← links)