The authors propose efficient linear-time algorithms to solve the earliest arrival time (EAT) and fastest path duration (FPD) problems in public transportation networks, achieving substantial speedups over state-of-the-art algorithms.
