<テクニカルレポート>
A Completeness Theorem for Polynomial-Time Local Search Problems

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 We give a series of combinatorial optimization problems defined by graph properties on vertex weighted graphs and allowing the local search methods. We show that the weighted vertex-induced subgraph p...roblem for any nontrivial hereditary property is complete for the class PLS of polynomial-time local search problems, which are defined to formalize the local search algorithms and their complexity of finding locally optimal solutions. Our result yields, without any specific discussions, the PLS-completeness of weighted vertex-induced subgraph problems for many well-known properties.続きを見る

本文情報を非表示

rifis-tr-33 pdf 778 KB 90  

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20