Basic studies on discrete enumeration algorithms
| Project/Area Number |
22500007
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University (2012-2013)
The University of Tokyo (2010-2011) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010-04-01 – 2015-03-31
|
| Project Status |
Completed (Fiscal Year 2014)
|
| Budget Amount *help |
¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2011: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | 列挙 / アルゴリズム論 / アルゴリズム |
|---|
| Outline of Final Research Achievements |
Recently, as well as the field of information science, enumeration algorithms are widely used in various fields, and their importance is recognized. In this study, we investigated basic properties on enumeration algorithms. In addition, we applied several ideas and techniques for enumeration algorithm to the other problem such as optimization and online problems. Especically we have analyzed competing ratio for online buyback problems.
|
Report
(5 results)
Research Products
(22 results)
