|
|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/9858
|
| Title: | On the complexity of reconfiguration problems |
| Authors: | Ito, Takehiro
Demaine, Erik D.
Harvey, Nicholas J.A.
Papadimitriou, Christos H.
Sideri, Martha
Uehara, Ryuhei
Uno, Yushi |
| Keywords: | approximation
graph algorithm
PSPACE-complete
reachability on solution space |
| Issue Date: | 2010-12-14 |
| Publisher: | Elsevier |
| Magazine name: | Theoretical Computer Science |
| Volume: | 412 |
| Number: | 12-14 |
| Start page: | 1054 |
| End page: | 1065 |
| DOI: | 10.1016/j.tcs.2010.12.005 |
| Abstract: | Reconfiguration problems arise when we wish to find a step-by-step transformationbetween two feasible solutions of a problem such that all intermediate results arealso feasible. We demonstrate that a host of reconfiguration problems derived fromNP-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. |
| Rights: | NOTICE: This is the author’s version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, and Yushi Uno, Theoretical Computer Science, 412(12-14), 2010, 1054-1065, http://dx.doi.org/10.1016/j.tcs.2010.12.005 |
| URI: | http://hdl.handle.net/10119/9858 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 16537-1.pdf | | 118Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
