Research on combinatorial optimization problems for finding solutions with extended structures
Project/Area Number |
25330018
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Theory of informatics
|
Research Institution | Kyushu Sangyo University |
Principal Investigator |
Asahiro Yuichi 九州産業大学, 情報科学部, 教授 (40304761)
|
Project Period (FY) |
2013-04-01 – 2017-03-31
|
Project Status |
Completed (Fiscal Year 2016)
|
Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,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,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
Keywords | 組合せ最適化 / アルゴリズム / 近似 / 計算複雑さ / 組合せ最適化問題 / グラフ / 近似アルゴリズム / 組み合わせ最適化問題 / オンラインアルゴリズム |
Outline of Final Research Achievements |
The objective of this research was to study combinatorial optimization problems for which we can extend or relax constraints on structure of solutions. The target problems were graph orientation problems, a problem to find a subgraph with small diameter, and a problem to find regular subgraphs, and so on. For these problems, we considered intractability or inapproximability of the problems, developed algorithms with theoretical performance guarantees, and evaluated practical performance of the developed algorithms by computer experiments. Results of this research were published as 12 papers in international conferences and journals, and also presented in 26 domestic conferences and research meetings.
|
Report
(5 results)
Research Products
(28 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 次数制約部分グラフ探索問題2014
Author(s)
朝廣雄一,江藤宏,伊藤健洋,宮野英次
Organizer
夏のLAシンポジウム2014
Place of Presentation
山口県岩国市半月庵
Year and Date
2014-07-17 – 2014-07-19
Related Report
-
-
-
-
-