Distance-r Independent Unlabeled Multi-Agent Pathfinding is PSPACE-complete, with reduction-based and configuration-generator algorithms that solve instances with hundreds of agents.
Hearn and Erik D
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete, implying PSPACE-completeness for spanning subgraph reconfiguration of (i,j)-bicliques and for two-component connected-components reconfiguration under all token rules.
citing papers explorer
-
Distance-Constrained Unlabeled Multi-Agent Pathfinding
Distance-r Independent Unlabeled Multi-Agent Pathfinding is PSPACE-complete, with reduction-based and configuration-generator algorithms that solve instances with hundreds of agents.
-
On (In)approximability of MaxMin Independent Set Reconfiguration
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
-
Biclique Reconfiguration in Bipartite Graphs
Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete, implying PSPACE-completeness for spanning subgraph reconfiguration of (i,j)-bicliques and for two-component connected-components reconfiguration under all token rules.