Studies on Upper and Lower Approximation Bounds for Graph Optimization Problems
| Project/Area Number |
20500017
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyushu Institute of Technology |
|---|
Principal Investigator |
MIYANO Eiji Kyushu Institute of Technology, 大学院・情報工学研究院, 准教授 (10284548)
|
|---|
| Project Period (FY) |
2008 – 2010
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Keywords | グラフ最適化問題 / 計算複雑さ / 近似上界 / 近似下界 / 直径d部分グラフ最大化問題 / 歪み最小化問題 / 最大頂点支配問題 / 最大辺支配問題 / NP困難問題 / アルゴリズム / 最小出次数最大化問題 / 弦グラフ / k部グラフ / カクタスグラフ / 強NP困難 / ソーティングバッファ問題 / メトリックスペース / 一様メトリック / マンハッタンネットワーク / 直径 / 部分グラフ |
|---|
| Research Abstract |
In this research, for many NP-hard graph optimization problems, we designed approximation algorithms, which run in polynomial time and are mathematically evaluated by the worst case possible relative errors over all possible instances of the problems. Also, we showed the lower bounds on approximability for NP-hard graph optimization problems. The inapproximability results demonstrate that unless NP=P we cannot guarantee to do substantially better in polynomial time.
|
Report
(4 results)
Research Products
(59 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 最大支配問題2010
Author(s)
小野廣隆
Organizer
電子情報通信学会コンピュテーション研究会
Place of Presentation
九州工業大学(福岡県)
Year and Date
2010-12-03
Related Report
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
