| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2020: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2017: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Outline of Final Research Achievements |
In this project, we proposed combinatorial optimization models for large-scale network analysis, and designed efficient algorithms with theoretical guarantees for the proposed models. In particular, we investigated the computational complexity and approximability of streaming algorithms for the problem of maximizing submodular functions with some constraints, and proposed new optimization models for the community detection problem in networks. These problems are general optimization problems that have been studied widely in theory and practice. Our results have been presented in refereed conferences in theoretical computer science and data mining, and published in international refereed journals.
|
