TY - JOUR
T1 - On the complexity of reconfiguration problems
AU - Ito, Takehiro
AU - Demaine, Erik D.
AU - Harvey, Nicholas J.A.
AU - Papadimitriou, Christos H.
AU - Sideri, Martha
AU - Uehara, Ryuhei
AU - Uno, Yushi
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Approximation
KW - Graph algorithm
KW - PSPACE-complete
KW - Reachability on solution space
UR - http://www.scopus.com/inward/record.url?scp=79751534041&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79751534041&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2010.12.005
DO - 10.1016/j.tcs.2010.12.005
M3 - Article
AN - SCOPUS:79751534041
SN - 0304-3975
VL - 412
SP - 1054
EP - 1065
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 12-14
ER -