Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds

Klaus-Tycho Foerster, Linus Groner, Torsten Hoefler, Michael K├Ânig, Sascha Schmid, Roger Wattenhofer. Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds. In Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos, editors, Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Volume 10236 of Lecture Notes in Computer Science, pages 247-259, 2017. [doi]

Abstract

Abstract is missing.