TY - GEN
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 - 2008
Y1 - 2008
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.
UR - http://www.scopus.com/inward/record.url?scp=58549112061&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58549112061&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-92182-0_6
DO - 10.1007/978-3-540-92182-0_6
M3 - Conference contribution
AN - SCOPUS:58549112061
SN - 3540921818
SN - 9783540921813
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 28
EP - 39
BT - Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings
T2 - 19th International Symposium on Algorithms and Computation, ISAAC 2008
Y2 - 15 December 2008 through 17 December 2008
ER -