| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2019: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2018: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
Most important combinatorial optimization problems are computationally intractable (NP-hard), i.e., there are no algorithm to find optimal solutions to such problems in polynoial time. The contributions of this research are mainly divided into the following two: (1) We designed approximation and/or fixed-parameter algorithms for optimization problems with weaker constraints, and (2) efficient algorithms for optimization problems with stronger constraints.
|
