2011 Fiscal Year Final Research Report
Hybrid Approaches to Computationally Hard Problems : Approximation, Randomization, and Parallelization
| Project/Area Number |
20500021
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tokyo Denki University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2008 – 2011
|
| Keywords | 近似アルゴリズム / 確率アルゴリズム / 並列アルゴリズム / NP困難性 |
|---|
| Research Abstract |
Problems that aim to maximize certain kinds of profit or minimize certain kinds of cost are ubiquitous in the real world. Such problems are called optimization problems and most of them are computationally hard. A well-used approach to hard optimization problems is approximation(which aims to find near-optimal solutions efficiently). In this project, we combine this approach with two other powerful approaches(namely, randomization and parallelization) and apply the resulting hybrid approach to several hard optimization problems. As the results, we have obtained more efficient algorithms for the hard problems than the previous bests.
|
-
-
-
-
-
-
-
-
-
[Presentation] A Linear Kernel for Co-Path/Cycle Packing2010
Author(s)
Zhi-Zhong Chen, M. R. Fellows, B. Fu, H. Jiang, Y. Liu, L. Wang, and B. Zhu
Organizer
Proceedings of 6th International Conference on Algorithmic Aspects in Information and Management(AAIM' 2010), Lecture Notes in Computer Science
Place of Presentation
Weihai, China
Year and Date
20100719-21
-
-
-
-
