Complexity of Fixed Order Routing

Steven Miltenburg, Tim Oosterwijk, René Sitters. Complexity of Fixed Order Routing. In Marcin Bienkowski, Matthias Englert, editors, Approximation and Online Algorithms - 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, Proceedings. Volume 15269 of Lecture Notes in Computer Science, pages 183-197, Springer, 2024. [doi]

Abstract

Abstract is missing.