Foremost non-stop journey arrival in linear time

DOI10.1007/978-3-031-09993-9_16MaRDI QIDQ2097355zbMATH OpenOpenAlexFDO

Authors Juan Villacis-Llobet, Binh-Minh Bui-Xuan, Maria Potop-Butucaru

Publication date 11 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09993-9_16

zbMATH Keywords

temporal graphforemost journeynon-stop journey

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Recommendations

• Optimising the travel time of a line plan
• scientific article; zbMATH DE number 4101157
• Line planning with minimal traveling time
• scientific article; zbMATH DE number 4009480
• Total time minimizing transportation problem
• Travel time tomography
• Travel time tomography
• Linearity in the traveling salesman problem
• Differentiability of the arrival time
• A Best-Choice Problem With Linear Travel Cost

Cites work

• A linear-time algorithm for a special case of disjoint set union
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connection Scan Algorithm
• Finding temporal paths under waiting time constraints
• Introduction to algorithms.
• Shortest, fastest, and foremost broadcast in dynamic networks
• Towards classifying the polynomial-time solvability of temporal betweenness centrality

This page was built for publication: Foremost non-stop journey arrival in linear time

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