| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
The objective of this research was to study combinatorial optimization problems for which we can extend or relax constraints on structure of solutions. The target problems were graph orientation problems, a problem to find a subgraph with small diameter, and a problem to find regular subgraphs, and so on. For these problems, we considered intractability or inapproximability of the problems, developed algorithms with theoretical performance guarantees, and evaluated practical performance of the developed algorithms by computer experiments. Results of this research were published as 12 papers in international conferences and journals, and also presented in 26 domestic conferences and research meetings.
|
