Study on Theory of Combinatorial Optimization with Applications to Robust Network Design
Project/Area Number |
16K16010
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Mathematical informatics
|
Research Institution | Kyoto University (2018-2019) University of Tsukuba (2016-2017) |
Principal Investigator |
|
Project Period (FY) |
2016-04-01 – 2020-03-31
|
Project Status |
Completed (Fiscal Year 2019)
|
Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2019: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2017: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
Keywords | 組合せ最適化 / アルゴリズム / グラフ / グラフアルゴリズム |
Outline of Final Research Achievements |
In this study, we developed a theory of combinatorial optimization problems arising in the context of robust network design. We dealt with generalized problems that are not dependent on a specific network or a specific situation. We designed efficient algorithms for many combinatorial optimization problems and analyzed their performance. In particular, we gave a first polynomial-time algorithm for the weighted linear matroid parity problem, which had been open for more than 30 years.
|
Academic Significance and Societal Importance of the Research Achievements |
本研究では,様々な組合せ最適化問題に対して効率的アルゴリズムを与えた.扱った問題はいずれも一般性の高い問題であるため,現実のネットワーク設計への応用に役立つと考えられる.また,本研究で解決した重み付き線形マトロイドパリティ問題は,30年以上未解決だった問題であり,この問題に対して初の多項式時間アルゴリズムを与えたことは,理論研究において大きな意義のある成果である.
|
Report
(5 results)
Research Products
(40 results)
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Diameter of colorings under Kempe changes2019
Author(s)
Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
-
Journal Title
Proc. of COCOON 2019, Lecture Notes in Computer Science
Volume: 11653
Pages: 52-64
DOI
ISBN
9783030261757, 9783030261764
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017
Author(s)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
-
Journal Title
Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)
Volume: ---
Pages: 287-296
DOI
NAID
ISBN
9783319623887, 9783319623894
Related Report
Peer Reviewed / Open Access
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-