| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2021: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2020: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2019: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2017: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
This research project studies several combinatorial optimization problems defined on graphs that can be modified by some procedures. Specifically, the studied problems are as follows: (i) The problem to find a subgraph with small fixed diameter in a social network, (ii) the problem to find a good assignment of jobs by assigning a direction to each edge and splitting a vertex in a graph, (iii) the problem to find a good partition of vertices in order to reduce the amount of data transfers, and so on. This research project basically tries to develop new algorithms and show computational complexities for those problems.
The obtained results have been published or presented in referred international journals (11 papers), referred international conferences (12 papers), and other research workshops (17 presentations).
|
