On the complexity of reconfiguration problems

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

Research output: Contribution to journalArticle

127 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1054-1065
Number of pages12
JournalTheoretical Computer Science
Volume412
Issue number12-14
DOIs
Publication statusPublished - 2011 Jan 7

Keywords

  • Approximation
  • Graph algorithm
  • PSPACE-complete
  • Reachability on solution space

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the complexity of reconfiguration problems'. Together they form a unique fingerprint.

  • Cite this

    Ito, T., Demaine, E. D., Harvey, N. J. A., Papadimitriou, C. H., Sideri, M., Uehara, R., & Uno, Y. (2011). On the complexity of reconfiguration problems. Theoretical Computer Science, 412(12-14), 1054-1065. https://doi.org/10.1016/j.tcs.2010.12.005