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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 412; H. 12; S. 1054 - 1065
Hauptverfasser: Ito, Takehiro, Demaine, Erik D., Harvey, Nicholas J.A., Papadimitriou, Christos H., Sideri, Martha, Uehara, Ryuhei, Uno, Yushi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Elsevier B.V 18.03.2011
Elsevier
Schlagworte:
Applied sciences
Approximation
Complexity
Computer science; control theory; systems
Exact sciences and technology
Graph algorithm
Mathematical models
Miscellaneous
PSPACE-complete
Reachability on solution space
Reconfiguration
Theoretical computing
Transformations
PSPACE-complete
Approximation
Reachability on solution space
Graph algorithm
Computer theory
NP complete problem
Reachability
Complexity
Reconfiguration
Polynomial time
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.12.005