2021 Fiscal Year Final Research Report
Designing Parameterized and Approximation Algorithms for weighted and directed graphs
| Project/Area Number |
19K21537
|
|---|
| Project/Area Number (Other) |
18H06469 (2018)
|
|---|
| Research Category |
Grant-in-Aid for Research Activity Start-up
|
| Allocation Type | Multi-year Fund (2019)
Single-year Grants (2018) |
|---|
| Review Section |
1001:Information science, computer engineering, and related fields
|
|---|
| Research Institution | Nagoya University (2020-2021)
Chuo University (2018-2019) |
|---|
Principal Investigator |
Hanaka Tesshu 名古屋大学, 情報学研究科, 助教 (30824982)
|
|---|
| Project Period (FY) |
2018-08-24 – 2022-03-31
|
| Keywords | グラフアルゴリズム / パラメータ化アルゴリズム / 近似アルゴリズム / 重み付きグラフ / 有向グラフ |
|---|
| Outline of Final Research Achievements |
Many real-world problems are formulated as graph optimization problems on directed and weighted graphs. However, they are often more complex than graph optimization problems on undirected and unweighted graphs. In this research, we designed efficient and high-accurate algorithms for various graph optimization problems defined not only on undirected and unweighted graphs, but also on weighted graphs, directed graphs, and weighted directed graphs, by using approximation and parameterization techniques.
|
| Free Research Field |
アルゴリズム理論
|
| Academic Significance and Societal Importance of the Research Achievements |
実ネットワークの中には，重みや辺の向きが重要なものも多数存在する．例えば，交通ネットワーク，取引ネットワーク，人物ネットワーク（社会ネットワーク）などである．これらの実ネットワークを対象とした問題の多くは計算困難であるため，重み付き有向グラフ最適化問題等に対して，効率的に高精度の解を求めるアルゴリズムの実現は学術的・社会的意義がある．
|
