On the complexity of reconfiguration problems

Takehiro Ito,Erik D. Demaine,Nicholas J. A. Harvey,Christos H. Papadimitriou,Martha Sideri,Ryuhei Uehara,Yushi Uno

Theoretical Computer Science（2011）

引用 231|浏览68

暂无评分

摘要

Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. We demonstrate that a host of reconfiguration problems derived from NP-complete problems are PSPACE-complete, while some are also NP-hard to approximate. In contrast, several reconfiguration versions of problems in P are solvable in polynomial time.

查看译文

关键词

step-by-step transformation,graph algorithm,reconfiguration version,reconfiguration problem,polynomial time,np-complete problem,reachability on solution space,intermediate result,feasible solution,approximation,pspace-complete

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要