Connection Scan Algorithm
From MaRDI portal
Publication:4629533
DOI10.1145/3274661OpenAlexW2599817911WikidataQ129110839 ScholiaQ129110839MaRDI QIDQ4629533
Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
Publication date: 27 March 2019
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05997
Related Items (5)
On computing Pareto optimal paths in weighted time-dependent networks ⋮ Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks ⋮ Temporal matching on geometric graph data ⋮ Unnamed Item ⋮ Foremost non-stop journey arrival in linear time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Intriguingly Simple and Fast Transit Routing
- The Price of Robustness in Timetable Information
- Stochastic Delay Prediction in Large Train Networks
- Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected
- Paying Less for Train Connections with MOTIS
- Trip-Based Public Transit Routing
- Efficient models for timetable information in public transportation systems
- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
- Efficient Timetable Information in the Presence of Delays
- Connection Scan Accelerated
- Scalable Transfer Patterns
- Round-Based Public Transit Routing
- Recoverable Robust Timetable Information
- Is Timetabling Routing Always Reliable for Public Transportl
- Delay-Robustness of Transfer Patterns in Public Transportation Route Planning
- Engineering multilevel overlay graphs for shortest-path queries
- Parallel computation of best connections in public transportation networks
- Dijkstra's algorithm on-line
This page was built for publication: Connection Scan Algorithm
