2024/04/30 by Mithinti Srikanth, G. Ramakrishna, Srikanth, Mithinti +1
Computer Science · Engineering · #Advanced Optical Network Technologies #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Network Traffic and Congestion Control
paper · pdf · doi:10.48550/arxiv.2404.19422
openalex publication_date 2024/04/30 · openalex created_date 2024/05/03 · openalex updated_date 2026/07/28
Public transport administrators rely on efficient algorithms for various problems that arise in public transport networks. In particular, our study focused on designing linear-time algorithms for two fundamental path problems: the earliest arrival time (eat) and the fastest path duration (fpd) on public transportation data. We conduct a comparative analysis with state-of-the-art algorithms. The results are quite promising, indicating substantial efficiency improvements. Specifically, the fastest path problem shows a remarkable 34-fold speedup, while the earliest arrival time problem exhibits an even more impressive 183-fold speedup. These findings highlight the effectiveness of our algorithms to solve eat and fpd problems in public transport, and eventually help public administrators to enrich the urban transport experience.