2014 Fiscal Year Final Research Report
Designing Efficient Algorithms for Combinatorial Optimization Problems with Discrete Convexity
| Project/Area Number |
23700016
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2011-04-28 – 2015-03-31
|
| Keywords | アルゴリズム / 離散凸解析 / マッチング理論 |
|---|
| Outline of Final Research Achievements |
In this research, we have revealed discrete convex structures in several combinatorial optimization problems and have designed efficient algorithms utilizing the discrete convexity.
(1) We have revealed discrete convex structures in the optimal matching forest and shortest bibranching problems. We have designed simpler and faster algorithms by utilizing the discrete convex structure.
(2) We have designed algorithms for finding several kinds of restricted 2-factors, which are close to Hamilton cycles. By making use of submodularity of cut functions, we obtained efficient algorithms for relaxation problems to the Hamilton cycle problem.
|
| Free Research Field |
組合せ最適化
|
