JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >

このアイテムの引用には次の識別子を使用してください: http://hdl.handle.net/10119/9858

タイトル: On the complexity of reconfiguration problems
著者: Ito, Takehiro
Demaine, Erik D.
Harvey, Nicholas J.A.
Papadimitriou, Christos H.
Sideri, Martha
Uehara, Ryuhei
Uno, Yushi
キーワード: approximation
graph algorithm
PSPACE-complete
reachability on solution space
発行日: 2010-12-14
出版者: Elsevier
誌名: Theoretical Computer Science
巻: 412
号: 12-14
開始ページ: 1054
終了ページ: 1065
DOI: 10.1016/j.tcs.2010.12.005
抄録: 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
資料タイプ: author
出現コレクション:b10-1. 雑誌掲載論文 (Journal Articles)

このアイテムのファイル:

ファイル 記述 サイズ形式
16537-1.pdf118KbAdobe PDF見る/開く

当システムに保管されているアイテムはすべて著作権により保護されています。

 


お問い合わせ先 : 北陸先端科学技術大学院大学 研究推進課図書館情報係