| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Research Abstract |
In this research, for many NP-hard graph optimization problems, we designed approximation algorithms, which run in polynomial time and are mathematically evaluated by the worst case possible relative errors over all possible instances of the problems. Also, we showed the lower bounds on approximability for NP-hard graph optimization problems. The inapproximability results demonstrate that unless NP=P we cannot guarantee to do substantially better in polynomial time.
|
