On the complexity of reconfiguration problems

Author(s)
Ito, Takehiro; Demaine, Erik D.; Harvey, Nicholas J.A.; Papadimitriou, Christos H.; Sideri, Martha; ... Show more
Thumbnail
DownloadDemaine-On the complexity.pdf (176.6Kb)
PUBLISHER_CC
Terms of use
Metadata
Show full item record
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.
Date issued
2010-12
URI
http://hdl.handle.net/1721.1/99966
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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
ISSN
03043975
Collections