Efficient algorithm design based on graph structural properties for graph optimization problems
| Project/Area Number |
26330017
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Kyushu Institute of Technology |
|---|
Principal Investigator |
Miyano Eiji 九州工業大学, 大学院情報工学研究院, 教授 (10284548)
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2016: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | グラフ最適化問題 / 計算困難性 / グラフ構造 / 多項式時間アルゴリズム / 最適アルゴリズム / 近似アルゴリズム / 近似困難性 / 成分素シュタイナー木埋込問題 / 直径限定部分グラフ探索問題 / 距離d独立集合問題 / 次数制約グラフ有向化問題 / シュタイナー木埋込問題 / 次数制約部分グラフ探索問題 |
|---|
| Outline of Final Research Achievements |
Most important graph optimization problems are computationally intractable (NP-hard), i.e., there are no algorithms to find optimal solutions to such problems in polynomial time. The contributions of this research are mainly divided into the following two: (1) We designed optimal algorithms which run in polynomial time for many graph optimization problems if the input graph has some graph properties such as regularity, induced-cycle length, and tree-likeness. (2) We designed polynomial-time algorithms which can find solutions closely approximating the optimal solutions for any input graph.
|
Report
(4 results)
Research Products
(60 results)
-
-
-
-
-
-
-
-
-
[Journal Article] Logging with maximum length constraint2016
Author(s)
Ei Ando, Akitoshi Kawamura, Masashi Kiyomi, Eiji Miyano, Hirotaka Ono
-
Journal Title
Proceedings of the 19th Japan-Korean Joint Workshop on Algorithms and Computation
Volume: -
Related Report
Peer Reviewed / Acknowledgement Compliant
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 次数制約部分グラフ探索問題の計算複雑さ2014
Author(s)
江藤宏，朝廣雄一，伊藤健洋，宮野英次
Organizer
情報処理学会九州支部若手の会セミナー2014
Place of Presentation
玄海ロイヤルホテル （福岡県宗像市）
Year and Date
2014-09-08 – 2014-09-09
Related Report
-
-
[Presentation] 次数制約部分グラフ探索問題2014
Author(s)
朝廣雄一，江藤宏，伊藤健洋，宮野英次
Organizer
夏のLAシンポジウム2014
Place of Presentation
半月庵 （山口県岩国市）
Year and Date
2014-07-17 – 2014-07-19
Related Report
-
-
-
-
-
-
-
-
-
-
