| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2016: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
Most important graph optimization problems are computationally intractable (NP-hard), i.e., there are no algorithms to find optimal solutions to such problems in polynomial time. The contributions of this research are mainly divided into the following two: (1) We designed optimal algorithms which run in polynomial time for many graph optimization problems if the input graph has some graph properties such as regularity, induced-cycle length, and tree-likeness. (2) We designed polynomial-time algorithms which can find solutions closely approximating the optimal solutions for any input graph.
|
