Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology

Cite

Text

Fioravantes et al. "Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I16.29686

Markdown

[Fioravantes et al. "Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/fioravantes2024aaai-exact/) doi:10.1609/AAAI.V38I16.29686

BibTeX

@inproceedings{fioravantes2024aaai-exact,
  title     = {{Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology}},
  author    = {Fioravantes, Foivos and Knop, Dusan and Kristan, Jan Matyás and Melissinos, Nikolaos and Opler, Michal},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {17380-17388},
  doi       = {10.1609/AAAI.V38I16.29686},
  url       = {https://mlanthology.org/aaai/2024/fioravantes2024aaai-exact/}
}