Image de couverture de livre

Fast and Memory Efficient Multimodal Journey Planning with Delays

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Katkalo, Denys, Rohovyi, Andrii, Walsh, Toby
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Adapting Dijkstra for Buffers and Unlimited Transfers
par: Katkalo, Denys, et autres
Publié: (2026)

Early Pruning for Public Transport Routing
par: Rohovyi, Andrii, et autres
Publié: (2026)

Timetable Nodes for Public Transport Network
par: Rohovyi, Andrii, et autres
Publié: (2024)

Group Trip Planning Query Problem with Multimodal Journey
par: Ali, Dildar, et autres
Publié: (2025)

Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams
par: Moreno, Matthew Andres, et autres
Publié: (2024)

Provably Fast and Space-Efficient Parallel Biconnectivity
par: Dong, Xiaojun, et autres
Publié: (2023)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
par: Bilò, Davide, et autres
Publié: (2024)

Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text
par: Adudodla, Ankith Reddy, et autres
Publié: (2025)

Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
par: Jiang, Zite, et autres
Publié: (2020)

List Update with Delays or Time Windows
par: Azar, Yossi, et autres
Publié: (2023)

Latency Guarantees for Caching with Delayed Hits
par: Gurushankar, Keerthana, et autres
Publié: (2025)

TRAPP: An Efficient Point-to-Point Path Planning Algorithm for Road Networks with Restrictions
par: Chen, Hanzhang, et autres
Publié: (2024)

Online TCP Acknowledgment under General Delays
par: Bhore, Sujoy, et autres
Publié: (2026)

Online Matching with Delays and Size-based Costs
par: Kawase, Yasushi, et autres
Publié: (2024)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Online Multi-level Aggregation with Delays and Stochastic Arrivals
par: Mari, Mathieu, et autres
Publié: (2024)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
par: Dufay, Marc, et autres
Publié: (2025)

Enumerating m-Length Walks in Directed Graphs with Constant Delay
par: Adamson, Duncan, et autres
Publié: (2024)

Fast Similarity Sketching
par: Dahlgaard, Søren, et autres
Publié: (2017)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
par: Kuo, Tung-Wei
Publié: (2024)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
par: Lindermayr, Alexander, et autres
Publié: (2026)

Fast In-Spectrum Graph Watermarks
par: Bourrée, Jade Garcia, et autres
Publié: (2025)

Fast Approximate Counting of Cycles
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Memory Reallocation with Polylogarithmic Overhead
par: Jin, Ce
Publié: (2026)

A Space-Efficient Algebraic Approach to Robotic Motion Planning
par: Bentert, Matthias, et autres
Publié: (2024)

Fast decremental tree sums in forests
par: Berendsohn, Benjamin Aram, et autres
Publié: (2026)

Fast and simple unrooted dynamic forests
par: Berendsohn, Benjamin Aram
Publié: (2023)

Fast Sampling Based Sketches for Tensors
par: Swartworth, William, et autres
Publié: (2024)

Fast Pattern Matching with Epsilon Transitions
par: Cotumaccio, Nicola
Publié: (2025)

Fast and Small Subsampled R-indexes
par: Cobas, Dustin, et autres
Publié: (2024)

Fast Schulze Voting Using Quickselect
par: Arora, Arushi, et autres
Publié: (2024)

Optimal $k$-Secretary with Logarithmic Memory
par: Qiao, Mingda, et autres
Publié: (2025)

Fast and Practical Single-Exponential Algorithms for Branchwidth
par: Kaneda, Taiki, et autres
Publié: (2026)

Noisy (Binary) Searching: Simple, Fast and Correct
par: Dereniowski, Dariusz, et autres
Publié: (2021)

Fast Algorithms for Graph Arboricity and Related Problems
par: Cen, Ruoxu, et autres
Publié: (2025)

Fast Practical Compression of Deterministic Finite Automata
par: Bille, Philip, et autres
Publié: (2023)

Fast and Compact Sketch-Based Dynamic Connectivity
par: De Man, Quinten, et autres
Publié: (2025)

A Simple and Fast Algorithm for Fair Cuts
par: Li, Jason, et autres
Publié: (2024)

Sublinear Spectral Clustering Oracle with Little Memory
par: Shen, Ranran, et autres
Publié: (2026)

Robust Streaming Against Low-Memory Adversaries
par: Ben-Eliezer, Omri, et autres
Publié: (2025)