|Budget Amount *help
¥16,120,000 (Direct Cost: ¥12,400,000、Indirect Cost: ¥3,720,000)
Fiscal Year 2018: ¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2017: ¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2016: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2015: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2014: ¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
|Outline of Final Research Achievements
This research develops a fast algorithm for not only enumeration problems, but also search and optimization problems by extracting and analyzing enumeration structures and combining them with discrete optimization methods, or proving computational hardness such as NP-hardness.
There are two major achievements: The first one is to construct a first polynomial time algorithm for the optimal composition ordering problem for
monotone increasing linear functions. The second result is to show exponential time lower bound of positive modular function minimization and to develop a fast exponential time algorithm. These won the International Conference ISAAC Best Paper Award and FIT2015 Funai Best Paper Award, respectively.