Skip to content

Author

Ariel Felner

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Aug 2026

Tree-MAPF: On the Complexity of Optimizing Multi Agent Path Finding on Tree Graphs

In its general form, Multi-Agent Path Finding (MAPF) is well known to be NP-hard for various optimization objectives. But determining the complexity boundary for restricted topologies remains a key theoretical challenge. This paper investigates the complexity of MAPF on tree topologies. While recent work has establishe...

Daniel Koyfman, Dor Atzmon, Shahaf S. Shperberg et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.