scientific article; zbMATH DE number 7121837
From MaRDI portal
Publication:5240129
DOI10.4230/OASIcs.ATMOS.2014.46zbMath1432.90018MaRDI QIDQ5240129
Gianlorenzo D'Angelo, Mattia D'Emidio, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Alessio Cionini, Christos D. Zaroliagis, Daniele Frigioni
Publication date: 24 October 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Engineering graph-based models for dynamic timetable information systems ⋮ Connection Scan Algorithm ⋮ Fully Dynamic 2-Hop Cover Labeling
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic multi-level overlay graphs for shortest paths
- Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
- Computing delay resistant railway timetables
- Intriguingly Simple and Fast Transit Routing
- Efficient models for timetable information in public transportation systems
- Recoverable Robustness in Shunting and Timetabling
- Engineering Time-Expanded Graphs for Faster Timetable Information
- Efficient Timetable Information in the Presence of Delays
- Fully dynamic update of arc-flags
- A New Dynamic Graph Structure for Large-Scale Transportation Networks
- Round-Based Public Transit Routing
- Customizable Contraction Hierarchies
- Is Timetabling Routing Always Reliable for Public Transportl
- Delay-Robustness of Transfer Patterns in Public Transportation Route Planning
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
- Geometric containers for efficient shortest-path computation
This page was built for publication:
