Foremost non-stop journey arrival in linear time
From MaRDI portal
Publication:2097355
DOI10.1007/978-3-031-09993-9_16OpenAlexW4285228787MaRDI QIDQ2097355FDOQ2097355
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
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
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Introduction to algorithms.
- A linear-time algorithm for a special case of disjoint set union
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Finding temporal paths under waiting time constraints
- Shortest, fastest, and foremost broadcast in dynamic networks
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- Connection Scan Algorithm
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)
