Computer Science Approach for Expanding Combinatorial Reconfiguration: Toward Automatic Generation of Algorithms

2023 Fiscal Year Final Research Report

• Project Area: Fusion of Computer Science, Engineering and Mathematics Approaches for Expanding Combinatorial Reconfiguration
• Project/Area Number: 20H05793
• Research Category: Grant-in-Aid for Transformative Research Areas (B)
• Allocation Type: Single-year Grants
• Review Section: Transformative Research Areas, Section (IV)
• Research Institution: Tohoku University
• Principal Investigator: ITO Takehiro 東北大学, 情報科学研究科, 教授 (40431548)
• Co-Investigator(Kenkyū-buntansha): 和佐 州洋 法政大学, 理工学部, 准教授 (00781337) ; 山内 由紀子 九州大学, システム情報科学研究院, 教授 (10546518) ; 小林 靖明 北海道大学, 情報科学研究院, 准教授 (60735083) ; 大舘 陽太 名古屋大学, 情報学研究科, 准教授 (80610196)
• Project Period (FY): 2020-10-02 – 2023-03-31
• Keywords: 組合せ遷移 / グラフアルゴリズム / 列挙アルゴリズム / 分散アルゴリズム

Outline of Final Research Achievements

In this research, based in the field of computer science, we have published 73 peer-reviewed papers over a period of 3.5 years, including the carryover period. Through these studies, we were not only able to advance case studies of algorithms for various combinatorial reconfiguration problems, but we also succeeded in achieving our goal of establishing algorithmic meta-theorems for combinatorial reconfiguration. Additionally, we have made research advancements by incorporating enumeration and distributed computing methods from closely related fields into combinatorial reconfiguration. Furthermore, we have collaborated with other project groups and researchers from outside the project, enabling us to tackle various expansions in the algorithmic theory of combinatorial reconfiguration.

Free Research Field

アルゴリズム

Academic Significance and Societal Importance of the Research Achievements

本研究のアルゴリズム的メタ定理は，遷移ステップ数をパラメータとせず，グラフ構造指標のみに基づいており，そのようなメタ定理の構築は世界初である．我々のメタ定理によって，優に30を超える組合せ遷移問題が，個別にアルゴリズムを設計することなく解ける．その他，組合せ遷移問題のベンチマークデータの作成・分析，産学連携研究を通した配電網の停電復旧アルゴリズムの開発等，組合せ遷移の新たな研究展開や社会実装に向けた研究も行うことができた．