On the Complexity of Reconfiguration Problems

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

DOI: 10.1007/978-3-540-92182-0_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5369)
Cite this paper as:
Ito T. et al. (2008) On the Complexity of Reconfiguration Problems. In: Hong SH., Nagamochi H., Fukunaga T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Takehiro Ito
    • 1
  • Erik D. Demaine
    • 2
  • Nicholas J. A. Harvey
    • 2
  • Christos H. Papadimitriou
    • 3
  • Martha Sideri
    • 4
  • Ryuhei Uehara
    • 5
  • Yushi Uno
    • 6
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan
  2. 2.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  3. 3.Computer Science DivisionUniversity of California at BerkeleyBerkeleyUSA
  4. 4.Department of Computer ScienceAthens University of Economics and BusinessAthensGreece
  5. 5.School of Information ScienceJAISTIshikawaJapan
  6. 6.Graduate School of ScienceOsaka Prefecture UniversitySakaiJapan

Personalised recommendations