[DMO] Martijn van Ee: Exact and approximation algorithms for routing a convoy through a graph

09 June 2023 14:00 till 15:00 - Location: EEMCS Lecture Hall F | Add to my calendar

In convoy routing problems, we assume that each edge in the graph has a length and a speed at which it can be traversed, and that our convoy has a given length. At any moment, due to safety requirements, the speed of the convoy is dictated by the slowest edge on which currently a part of the convoy is located. In this talk, I will discuss the complexity and approximability of some classical routing problems in the convoy setting. This is joint work with Tim Oosterwijk (VU), René Sitters (VU), and Andreas Wiese (TU Munich).