2009 Fiscal Year Final Research Report
Heuristic algorithms with reasonable running time
| Project/Area Number |
20700003
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
ITO Takehiro Tohoku University, 大学院・情報科学研究科, 助教 (40431548)
|
|---|
| Project Period (FY) |
2008 – 2009
|
| Keywords | アルゴリズム理論 |
|---|
| Research Abstract |
In this research, we obtained heuristic algorithms which runs in reasonable time from the viewpoint of practical applications. We dealt with two graph partition problems, called the power-supply problem and the uniform partition problem. For the power-supply problem, we gave an approximation algorithm, called an FPTAS. Based on the FPTAS, we also gave a heuristic algorithm. For the uniform partition problem, we gave a polynomial-time algorithm which finds an optimal solution for trees.
|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] On the Complexity of Reconfiguration Problems2008
Author(s)
Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
Organizer
19th Annual International Symposium on Algorithms and Computation
Place of Presentation
オーストラリア・ゴールドコースト
Year and Date
2008-12-15
