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]

@inproceedings{FoersterGHKSW17,
  title = {Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds},
  author = {Klaus-Tycho Foerster and Linus Groner and Torsten Hoefler and Michael König and Sascha Schmid and Roger Wattenhofer},
  year = {2017},
  doi = {10.1007/978-3-319-57586-5_21},
  url = {https://doi.org/10.1007/978-3-319-57586-5_21},
  researchr = {https://researchr.org/publication/FoersterGHKSW17},
  cites = {0},
  citedby = {0},
  pages = {247-259},
  booktitle = {Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings},
  editor = {Dimitris Fotakis and Aris Pagourtzis and Vangelis Th. Paschos},
  volume = {10236},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-319-57586-5},
}