An efficient algorithm for the fast delivery problem

DOI10.1007/978-3-030-25027-0_12zbMath1464.68277arXiv1904.09142OpenAlexW2938249278MaRDI QIDQ2291419

Iago A. Carvalho, Kleitos Papadopoulos, Erlebach, Thomas

Publication date: 30 January 2020

Full work available at URL: https://arxiv.org/abs/1904.09142

zbMATH Keywords

polynomial-time algorithmmobile agentsDijkstra's algorithmtime-dependent shortest paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Artificial intelligence for robotics (68T40)

Related Items (3)

On the fast delivery problem with one or two packages ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ New approximation algorithms for the heterogeneous weighted delivery problem

This page was built for publication: An efficient algorithm for the fast delivery problem