On the complexity of reconfiguration problems

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.

[1]  Paul S. Bonsma,et al.  Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances , 2007, Theor. Comput. Sci..

[2]  Takehiro Ito,et al.  Reconfiguration of list edge-colorings in a graph , 2009, Discret. Appl. Math..

[3]  Takehiro Ito,et al.  Partitioning trees of supply and demand , 2005, Int. J. Found. Comput. Sci..

[4]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Erik D. Demaine,et al.  PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..

[7]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[8]  Takehiro Ito,et al.  On the complexity of reconfiguration problems , 2008, Theor. Comput. Sci..

[9]  Christos H. Papadimitriou,et al.  The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies , 2006, SIAM J. Comput..

[10]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[11]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[12]  Takehiro Ito,et al.  Approximability of partitioning graphs with supply and demand , 2006, J. Discrete Algorithms.

[13]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[14]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.