Design and Analysis of Algorithms for Computationally Intractable Combinatorial Problems
| Project/Area Number |
20700011
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
TAMAKI Suguru Kyoto University, 情報学研究科, 助教 (40432413)
|
|---|
| Project Period (FY) |
2008 – 2010
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2009: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | 計算量理論 / アルゴリズム理論 / 厳密アルゴリズム / 充足可能性問題 / 計算困難性 / 彩色問題 / グラフ理論 / 証明の複雑さ |
|---|
| Research Abstract |
Many practical optimization problems are known to be NP-hard, which is the class of computationally intractable problems. In this study, we gave design and complexity analysis of efficient exact algorithms for such computationally difficult problems. As a result, we obtained improved algorithms for the satisfiability problems (SAT) and the Boolean connectivity problems. We also gave characterizations of the complexity of the Boolean connectivity problems for Horn-SAT and the 3-colorability problems for planar graphs.
|
Report
(4 results)
Research Products
(34 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Book] 離散数学のすすめ2010
Author(s)
伊藤大雄, 宇野裕之編著, (玉置卓,第16章)
Total Pages
325
Publisher
現代数学社
Related Report
-
