| Project/Area Number |
21500014
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
ITO Hiro 京都大学, 大学院・情報学研究科, 准教授 (50283487)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
IWAMA Kazuo 京都大学, 大学院・情報学研究科, 教授 (50131272)
|
|---|
| Project Period (FY) |
2009 – 2011
|
| Project Status |
Completed (Fiscal Year 2011)
|
| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2011: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2010: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2009: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | アルゴリズム理論 / 定数時間アルゴリズム / グラフアルゴリズム / グラフ / ネットワーク / アルゴリズム / 定数時間 / 乱択 / マトロイド / ナップザック問題 / オンラインアルゴリズム / ユニットディスクグラフ / FPT / 計算複雑さ / 下界値 / 性質検査 / 近似アルゴリズム |
|---|
| Research Abstract |
We investigated fast algorithms for treating big data, and lower bounds about them. Especially, algorithms that see only constant number of data of the given instance are mainly investigated. We obtained fast constant-time algorithms for approximating the size of the maximum independent set and the maximum matching of graphs, a testing outerplanarity of graphs, approximating the rank of sparsity matroids, and approximating the solution of the knapsack problem. And we presented new tools for showing linear lower bounds for testing algorithms. Moreover, we considered to parametrize unit disk graphs by the area, and gave some FPT algorithms and lower bounds on some problems on them.
|
