On the complexity of reconfiguration problems
Name
Demaine-On the complexity.pdf
Size
176.68 KB
Format
Adobe PDF
Checksum (MD5)
23c21304df1cd12f8bca7fb587f6d4d8
Author(s)
Ito, Takehiro
Demaine, Erik D.
Harvey, Nicholas J.A.
Papadimitriou, Christos H.
Sideri, Martha
Uehara, Ryuhei
Uno, Yushi
Date Issued
December 2010
Journal
Theoretical Computer Science
Publisher
Elsevier
Citation
Ito, Takehiro, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno. “On the Complexity of Reconfiguration Problems.” Theoretical Computer Science 412, no. 12–14 (March 2011): 1054–1065.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.tcs.2010.12.005
