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]

Authors

Klaus-Tycho Foerster

This author has not been identified. Look up 'Klaus-Tycho Foerster' in Google

Linus Groner

This author has not been identified. Look up 'Linus Groner' in Google

Torsten Hoefler

This author has not been identified. Look up 'Torsten Hoefler' in Google

Michael König

This author has not been identified. Look up 'Michael König' in Google

Sascha Schmid

This author has not been identified. Look up 'Sascha Schmid' in Google

Roger Wattenhofer

This author has not been identified. Look up 'Roger Wattenhofer' in Google