| Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
We studied the iterative rounding method, which is known as a framework for designing approximation algorithms to combinatorial optimization problems. We found a new idea on the formulation of a linear programming relaxation of the network activation problem and the several node-weighted graph covering problems, based on which we gave new approximation algorithms for these problems. Moreover, for the generalized terminal backup problem, we presented a new approximation algorithm, that outperforms the previously known best approximation algorithm based on the iterative rounding method. Furthermore, we considered the k-connected m-dominating set problem on unit disk graphs, which have applications in wireless ad hoc networks. We presented a new constant-approximation algorithm for this problem.
|
