| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2017: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Outline of Final Research Achievements |
In practical algorithms for tree width calculation, we have achieved notable results. Applying a positive-instance driven approach to traditional dynamic programming algorithms for treewidth computation, we were able to turn those algorithm, that had been thought as having only theoretical value, into practical algorithms. Both the classical algorithm due to Arnborg et. al. and the one due to Bouchitte and Todinca were modified to work in a positive-instance driven mode and were found to be very effective. Their implementations won the 1st and 2nd prizes in PACE 2016 and PACE 2017, respectively, which are algorithm implementation competitions. The results are also described in a paper submitted to the European Symposium (2017) and won the Best Paper Award in Algorithms in Track B.
|
