We introduce the combinatorial optimization problem Time Disjoint Walks. This problem takes as input a digraph G with positive integer arc lengths, and k pairs of vertices that each represent a trip demand from a source to a destination. The goal is to find a path and delay for each demand so that no two trips occupy the same vertex at the same time, and so that the sum of trip times is minimized. We show that even for DAGs with max degree Δ ≤ 3, Time Disjoint Walks is APXhard. We also present a natural approximation algorithm, and provide a tight analysis. In particular, we prove that it achieves an approximation ratio of Θ(k/log k) on bounded-degree DAGs, and Θ(k) on DAGs and bounded-degree digraphs.
CITATION STYLE
Bayen, A., Goodman, J., & Vinitsky, E. (2018). On the approximability of time disjoint walks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11346 LNCS, pp. 62–78). Springer Verlag. https://doi.org/10.1007/978-3-030-04651-4_5
Mendeley helps you to discover research relevant for your work.