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
|
Project Status |
Completed (Fiscal Year 2021)
|
Budget Amount *help |
¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2018: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
Keywords | グラフアルゴリズム / パラメータ化アルゴリズム / 近似アルゴリズム / 重み付きグラフ / 有向グラフ / 計算複雑性 / グラフ最適化問題 / パラメータ化近似アルゴリズム / 固定パラメータ容易性 / アルゴリズム的ゲーム理論 |
Outline of Research at the Start |
グラフ最適化問題は工学,情報学,経済学をはじめとした様々な分野における自然な問題としてしばしば現れる.それらの多くは,現実的な時間で解を求めることが難しいと考えられているが,近似アルゴリズムやパラメータ化アルゴリズムといった高性能アルゴリズム設計手法の発展によって,ある程度効率的に解を求めることが可能になった.近年では,これらに加えて,高速高精度なパラメータ化近似アルゴリズムが注目されている. 本研究では,一般に広く研究されている重み無し無向グラフのみならず,重み付き有向グラフなどのより記述力の高いグラフに対する高速高精度グラフアルゴリズムの設計を目指す.
|
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.
|
Academic Significance and Societal Importance of the Research Achievements |
実ネットワークの中には,重みや辺の向きが重要なものも多数存在する.例えば,交通ネットワーク,取引ネットワーク,人物ネットワーク(社会ネットワーク)などである.これらの実ネットワークを対象とした問題の多くは計算困難であるため,重み付き有向グラフ最適化問題等に対して,効率的に高精度の解を求めるアルゴリズムの実現は学術的・社会的意義がある.
|
Report
(5 results)
Research Products
(79 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] (In)approximability of Maximum Minimal FVS2020
Author(s)
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
-
Journal Title
Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020),
Volume: 181
Pages: 208-220
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
[Journal Article] Parameterized Complexity of (A,l)-Path Packing2020
Author(s)
Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
-
Journal Title
Lecture Notes in Computer Science
Volume: 12126
Pages: 43-55
DOI
ISBN
9783030489656, 9783030489663
Related Report
Peer Reviewed / Int'l Joint Research
-
[Journal Article] Hedonic Seat Arrangement Problems2020
Author(s)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
-
Journal Title
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020)
Volume: -
Pages: 1777-1779
Related Report
Peer Reviewed / Int'l Joint Research
-
[Journal Article] Parameterized Algorithms for the Happy Set Problem2020
Author(s)
Asahiro Yuichi、Eto Hiroshi、Hanaka Tesshu、Lin Guohui、Miyano Eiji、Terabaru Ippei
-
Journal Title
Proc. 14th International Conference and Workshops on Algorithms and Computation
Volume: LNCS12049
Pages: 323-328
DOI
ISBN
9783030398804, 9783030398811
Related Report
Peer Reviewed / Int'l Joint Research
-
-
[Journal Article] Parameterized Orientable Deletion2020
Author(s)
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
-
Journal Title
Algorithmica
Volume: -
Issue: 7
Pages: 1909-1938
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
-
-
-
-
[Journal Article] Computational Complexity of Hedonic Games on Sparse Graphs2019
Author(s)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
-
Journal Title
Proceedings of the International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2019) / Lecture Notes in Computer Science (LNCS)
Volume: 11873
Pages: 576-584
DOI
ISBN
9783030337919, 9783030337926
Related Report
Peer Reviewed
-
-
[Journal Article] Parameterized Complexity of Safe Set2019
Author(s)
Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
-
Journal Title
Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC 2019)
Volume: 11485
Pages: 38-49
DOI
ISBN
9783030174019, 9783030174026
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Parameterized Complexity of (A,l)-Path Packing2020
Author(s)
Remy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Organizer
The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020)
Related Report
Int'l Joint Research
-
[Presentation] Hedonic Seat Arrangement Problems2020
Author(s)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Organizer
The 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020)
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Parameterized Complexity of Safe Set2019
Author(s)
Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Organizer
The 11th International Conference on Algorithms and Complexity (CIAC 2019)
Related Report
Int'l Joint Research
-
-
-
-
-
-
-