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: Chapter in Book/Report/Conference proceedingConference contribution

9 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
Title of host publicationAlgorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings
Pages28-39
Number of pages12
DOIs
Publication statusPublished - 2008 Dec 1
Event19th International Symposium on Algorithms and Computation, ISAAC 2008 - Gold Coast, QLD, Australia
Duration: 2008 Dec 152008 Dec 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5369 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Symposium on Algorithms and Computation, ISAAC 2008
CountryAustralia
CityGold Coast, QLD
Period08/12/1508/12/17

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. (2008). On the complexity of reconfiguration problems. In Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings (pp. 28-39). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5369 LNCS). https://doi.org/10.1007/978-3-540-92182-0_6