Designing Efficient Algorithms for Optimization Problems with Combinatorial Structures
Project/Area Number |
25730001
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Theory of informatics
|
Research Institution | The University of Tokyo |
Principal Investigator |
|
Project Period (FY) |
2013-04-01 – 2017-03-31
|
Project Status |
Completed (Fiscal Year 2016)
|
Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2016: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
Keywords | アルゴリズム / グラフマイナー理論 / 固定パラメータ・アルゴリズム / 線形相補性問題 / 疎性 / グラフ彩色 / イマージョン / パッキング / 固定パラメータアルゴリズム / マトロイド交わり / 多項式時間アルゴリズム / 被覆 / 整数性 |
Outline of Final Research Achievements |
In this project, we designed efficient algorithms for continuous and discrete optimization problems using their combinatorial structures. For discrete optimization problems, we analyzed combinatorial structures such as the Erdos-Posa property for packing/covering integer programming problems. The analysis is based on structural graph theory. The structures we found are used to develop efficient fixed-parameter algorithms. For continuous optimization problems, we mainly focused on the linear complementarity problems. We discussed the integrality of the linear complementarity problems. We also proposed efficient algorithms for LCP exploiting the sparsity.
|
Report
(5 results)
Research Products
(30 results)
-
-
-
-
-
-
-
-
[Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2014
Author(s)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
-
Journal Title
Lecture Notes in Computer Science
Volume: 8889
Pages: 195-207
DOI
ISBN
9783319130743, 9783319130750
Related Report
Peer Reviewed / Acknowledgement Compliant
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-