(1)
Tan, X.; Grastien, A. Inapproximability of Optimal Multi-Agent Pathfinding Problems. AAAI 2025, 39, 26707-26715.