| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
rifis-tr-33