| Budget Amount *help |
¥12,610,000 (Direct Cost: ¥9,700,000、Indirect Cost: ¥2,910,000)
Fiscal Year 2014: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2013: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2012: ¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2011: ¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
|
|---|
| Outline of Final Research Achievements |
Submodularity is known to be a common structure among various efficiently solvable discrete optimization problems. On the other hand, most discrete optimization problems that arise in practice are NP-hard, and researchers have designed efficient algorithms for finding approximately optimal solutions. Combining these two streams of research in discrete optimization, we have tried to develop a systematic approach to design approximation algorithms for a generic framework of submodular optimization. In particular, we have provided a 1/2-approximation algorithm for maximizing k-submodular functions. We have also designed an approximation algorithm for maximizing monotone k-submodular functions within the ratio of k/2(k-1).
|
