2013 Fiscal Year Final Research Report
Algorithm design techniques based on transformation into network structure
| Project/Area Number |
23500015
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
ZHAO Liang 京都大学, 大学院・情報学研究科, 講師 (90344902)
FUKUNAGA Takuro 国立情報学研究所, ビッグデータ数理国際研究センター, 准教授 (60452314)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Keywords | 数理工学 / 計算機科学 / グラフ理論 / 離散最適化 / 厳密解法 / 計算量解析 / 近似解法 |
|---|
| Research Abstract |
Our aim is to design algorithms for discrete optimization problems with graph structure. We have obtained approximation algorithms and exact algorithms for several NP-hard but important problems such as the maximum independent set problem.
We have theoretically analyzed the approximation ratios of our approximation algorithms and derived upper bounds on the time complexities of our exact algorithms.
In particular, for designing exact algorithms, we have devised new design techniques such as amortization by shifts, decomposition by cut-pairs,and how to compute the largest root of a set of recursive equations.
|
