2013 Fiscal Year Final Research Report
Local Optima Approximation Scheme based on Combinatorial Local Search Algorithms
| Project/Area Number |
21680001
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (A)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyushu University |
|---|
Principal Investigator |
ONO Hirotaka 九州大学, 経済学研究科(研究院), 准教授 (00346826)
|
|---|
| Project Period (FY) |
2009-04-01 – 2013-03-31
|
| Keywords | 組合せ最適化 / 局所探索 / 解再構成 / 再最適化 / 近似アルゴリズム / グラフアルゴリズム |
|---|
| Research Abstract |
Many useful combinatorial optimization problems are known to be NP-hard, which means that these problems are difficult (or probably impossible) to find solutions guaranteed to be (near-)optimal in reasonable computational time. On the other hand, in spite of the difficulty, metaheuristics algorithms are known to find "practically" good solutions (not necessarily in reasonable computational time. In this study, we investigated local-search type meta-heuristics from the "theoretical" viewpoints. We obtain several results:
(1) Design and analysis of (local-search type) approximation algorithms for graph optimization problems, (2) Computational complexity of the reconfiguration problems for graph optimization problems, (3) Computational complexity of the reoptimization of graph optimization problems.
|
