Tzvika Geft, Dan Halperin. Refined Hardness of Distance-Optimal Multi-Agent Path Finding. In Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor, editors, 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022. pages 481-488, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022. [doi]
@inproceedings{GeftH22,
title = {Refined Hardness of Distance-Optimal Multi-Agent Path Finding},
author = {Tzvika Geft and Dan Halperin},
year = {2022},
url = {https://dl.acm.org/doi/10.5555/3535850.3535905},
researchr = {https://researchr.org/publication/GeftH22},
cites = {0},
citedby = {0},
pages = {481-488},
booktitle = {21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022},
editor = {Piotr Faliszewski and Viviana Mascardi and Catherine Pelachaud and Matthew E. Taylor},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)},
isbn = {978-1-4503-9213-6},
}