Temporal Routing in Static Networks: The Schedule Completion Problem

Michelle Döring, Michelle Döring, Niklas Mohrin +1

We introduce the Temporally Edge Disjoint Schedule Completion (TEDSC) problem in which we need to cover a set of temporal edge demands $D$ by routing $k$ temporal walks through a d…