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
|
| Project Status |
Completed (Fiscal Year 2014)
|
| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2013: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| 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.
|
Report
(5 results)
Research Products
(28 results)
