| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Outline of Final Research Achievements |
In this research, we designed polynomial-space exact algorithms based on the branching method to several representative problems in discrete optimization such as the independent set problem,
the traveling salesman problem in degree-bounded graphs, the feedback vertex set problem, the edge dominating set problem, and analyzed that upper bounds on the time complexities of these algorithms are currently best among the existing algorithms. We also designed an algorithm for constructing a kernel to the problem of partitioning a graph into two degree-bounded graphs, and a strategy-proof mechanism to the facility location game problem.
|
