| Project/Area Number |
19700017
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | National Institute of Informatics |
|---|
Principal Investigator |
UNO Takeaki National Institute of Informatics, 情報学プリンシプル研究系, 准教授 (00302977)
|
|---|
| Project Period (FY) |
2007 – 2010
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥4,020,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥720,000)
Fiscal Year 2010: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2009: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2008: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2007: ¥900,000 (Direct Cost: ¥900,000)
|
|---|
| Keywords | 列挙 / アルゴリズム / 極大 / 極小 / 双対化 / 極大元 / 極小集合被覆 / マトロイド / 出力多項式時間 |
|---|
| Research Abstract |
Maximal (minimal) solutions are those not included in (not including) other solutions. Generally speaking, enumeration of maximal (minimal) solutions is not easy since they usually have no neighboring relations. In this research, we research efficient schemes of enumeration based on algorithmic technologies such as reverse search and the use of sparsity. As a result, we developed efficient enumeration algorithms for multi criteria optimization problem, perfect sequence, dense subgraph, ambiguous frequent itemset, and distance hereditary graphs.
|
