Connection scan accelerated

DOI10.1137/1.9781611973198.12MaRDI QIDQ5232497zbMATH OpenOpenAlexFDO

Authors Ben Strasser, Dorothea Wagner

Publication date 12 September 2019

Published in 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973198.12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Recommendations

• Connection Scan Algorithm
• Intriguingly simple and fast transit routing
• Time-dependent networks as models to achieve fast exact time-table queries
• Accelerating time-dependent multi-criteria timetable information is harder than expected
• Trip-based public transit routing

Cited in

(6)

• Time-dependent networks as models to achieve fast exact time-table queries
• Intriguingly simple and fast transit routing
• How to find good night train connections
• Connection Scan Algorithm
• scientific article; zbMATH DE number 7525451 (Why is no real title available?)
• Parallel computation of best connections in public transportation networks

This page was built for publication: Connection scan accelerated

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