| Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2009: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Research Abstract |
The purpose of this research is the design and analysis of approximation algorithms for the independent problem and the biclique covering(partitioning) problem of a graph. For the independent set problem, we proposed a notion of“weighted degree"of a vertex in a weighted graph, and gave approximation algorithms. We also gave an approximation algorithm for finding an independent set of a C_k-free graph. For the biclique covering problem, we proposed a method using a“set covering approach,"and for the biclique partition problem, we gave a formulation using the“exclusive rank"of a Boolean matrix. Furthermore, we discussed the approximation hardness of this problem.
|
