Design Theory and Implementation of Fast Algorithms to Graph Optimization

• Project/Area Number: 26330012
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Theory of informatics
• Research Institution: Kyoto University
• Principal Investigator: Hiroshi Nagamochi 京都大学, 情報学研究科, 教授 (70202231)
• Co-Investigator(Kenkyū-buntansha): 趙 亮 京都大学, 総合生存学館, 准教授 (90344902)
• Project Period (FY): 2014-04-01 – 2017-03-31
• Project Status: Completed (Fiscal Year 2016)
• Budget Amount: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000); Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000); Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000); Fiscal Year 2014: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
• Keywords: 情報工学 / アルゴリズム / 高速コンピューティング / 数理計画 / 最適化 / グラフ理論 / 計算量 / ネットワーク構造 / 離散最適化 / グラフ描画 / スケジューリング

Outline of Final Research Achievements

In this research, we designed polynomial-space exact algorithms based on the branching method　to several representative problems in discrete optimization such as the independent set problem,
the traveling salesman problem in degree-bounded graphs, the feedback vertex set problem, the edge dominating set problem, and analyzed that upper bounds on the time complexities of these algorithms are currently best among the existing algorithms. We also designed an algorithm for constructing a kernel to the problem of partitioning a graph into two degree-bounded graphs, and a strategy-proof mechanism to the facility location game problem.

Research Products

• [Int'l Joint Research] シドニー大学情報科学科 (オーストラリア)
• [Int'l Joint Research] 電子科技大學計算機科學與工程學院 (中国)
• [Int'l Joint Research] シドニー大学(オーストラリア)
• [Int'l Joint Research] 電子科技大学(中国)
• [Journal Article] Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game (2017)
  • Author(s): Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 21(3) Pages: 247-263
  • DOI: 10.1007/978-3-319-30139-6_23
  • ISBN: 9783319301389, 9783319301396
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Complexity and kernels for bipartition into degree-bounded induced graphs (2017)
  • Author(s): Mingyu Xiao, Hiroshi Nagamochi
  • Journal Title: Theoretial Computer Science Volume: 659 Pages: 72-82
  • DOI: 10.1007/978-3-319-13075-0_34
  • ISBN: 9783319130743, 9783319130750
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] An Exact Algorithm for Lowest Edge Dominating Set (2017)
  • Author(s): K. Iwaide, H. Nagamochi
  • Journal Title: IEICE Transactions on Information and Systems Volume: E100.D Issue: 3 Pages: 414-421
  • DOI: 10.1587/transinf.2016FCP0005
  • NAID: 130005397877
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed / Open Access
• [Journal Article] Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees (2016)
  • Author(s): M. Oomine, H. Nagamochi
  • Journal Title: IEICE Transactions on Information and Systems Volume: E99.D Issue: 3 Pages: 615-623
  • DOI: 10.1587/transinf.2015FCP0008
  • NAID: 130005131816
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed
• [Journal Article] An Improved Algorithm for Parameterized Edge Dominating Set Problem (2016)
  • Author(s): Ken Iwaide, Hiroshi Nagamochi
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 20(1) Issue: 1 Pages: 23-58
  • DOI: 10.7155/jgaa.00383
  • Peer Reviewed
• [Journal Article] An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure (2016)
  • Author(s): Mingyu Xiao, Hiroshi Nagamochi
  • Journal Title: Algorithmica Volume: 74(2) Issue: 2 Pages: 713-741
  • DOI: 10.1007/s00453-015-9970-4
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] An exact algorithm for maximum independent set in degree-5 graphs (2016)
  • Author(s): Mingyu Xiao, Hiroshi Nagamochi
  • Journal Title: Discrete Applied Mathematics Volume: 199 Pages: 137-155
  • DOI: 10.1007/978-3-642-38756-2_10
  • ISBN: 9783642387555, 9783642387562
  • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4 (2016)
  • Author(s): M. Xiao, H. Nagamochi
  • Journal Title: Theory of Computing Systems Volume: 58(2) Issue: 2 Pages: 241-272
  • DOI: 10.1007/s00224-015-9612-x
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees (2016)
  • Author(s): M. Oomine, H. Nagamochi
  • Journal Title: IEICE Transactions Inf. and Syst. Volume: E99-D no. 3 Pages: 615-623
  • NAID: 130005131816
  • Peer Reviewed
• [Journal Article] An Improved Algorithm for Parameterized Edge Dominating Set Problem (2016)
  • Author(s): Ken Iwaide, Hiroshi Nagamochi
  • Journal Title: J. Graph Algorithms Appl. Volume: 20(1) Pages: 23-58
  • DOI: 10.1007/978-3-319-15612-5_21
  • ISBN: 9783319156118, 9783319156125
  • Peer Reviewed
• [Journal Article] Some Reduction Procedure for Computign Pathwidth of Undirected Graphs (2015)
  • Author(s): Masataka Ikeda, Hiroshi Nagamochi
  • Journal Title: IEICE Transactions98-D(3) Volume: 3 Pages: 503-511
  • Peer Reviewed
• [Presentation] A Linear-time Algorithm for Integral Multiterminal Flows in Trees (2016)
  • Author(s): Mingyu Xiao and Hiroshi Nagamochi
  • Organizer: The 27th International Symposium on Algorithm and Computation
  • Place of Presentation: Sydney, Australia
  • Year and Date: 2016-12-12
  • Int'l Joint Research
• [Presentation] Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time (2016)
  • Author(s): Seok-Hee Hong and Hiroshi Nagamochi
  • Organizer: The 24th International Symposium on Graph Drawing and Network Visualization
  • Place of Presentation: Athens, Greece
  • Year and Date: 2016-09-19
  • Int'l Joint Research
• [Presentation] Routing Problems with Last-Stretch Delivery (2016)
  • Author(s): M. S. B. Othman, A. Shurbevski, Y. Karuno, H. Nagamochi
  • Organizer: The 19th Japan Conference on Discrete and Computational Geometry and Graphs
  • Place of Presentation: Tokyo University of Science,Tokyo, Japan
  • Year and Date: 2016-09-02
  • Int'l Joint Research
• [Presentation] A Polynomial-space Exact Algorithm for the TSP in Degree-8 Graphs (2016)
  • Author(s): N. Md Yunos, A. Shurbevski, H. Nagamochi
  • Organizer: The 19th Japan-Korea Joint Workshop on Algorithms and Computation
  • Place of Presentation: 函館市民会館 北海道函館市
  • Year and Date: 2016-08-30
  • Int'l Joint Research
• [Presentation] Exact Algorithms for the Bipartite Traveling Salesman Problem (2016)
  • Author(s): M. S. B. Othman, A. Shurbevski, H. Nagamochi
  • Organizer: The 9th Annual Meeting of Asian Association for Algorithms and Computation
  • Place of Presentation: NTU, Taipei, Taiwan
  • Year and Date: 2016-05-14
  • Int'l Joint Research
• [Presentation] A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs (2016)
  • Author(s): N. Md Yunos, A. Shurbevski, H. Nagamochi
  • Organizer: The 9th Annual Meeting of Asian Association for Algorithms and Computation
  • Place of Presentation: NTU, Taipei, Taiwan
  • Year and Date: 2016-05-14
  • Int'l Joint Research
• [Presentation] Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game (2016)
  • Author(s): Morito Oomine, Aleksandar Shurbevski, and Hiroshi Nagamochi
  • Organizer: The 10th International Workshop on Algorithms and Computation
  • Place of Presentation: Kathmandu, Nepal
  • Year and Date: 2016-03-29
  • Int'l Joint Research
• [Presentation] A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs (2015)
  • Author(s): N. Md Yunos, A. Shurbevski, H. Nagamochi
  • Organizer: The 18th Japan Conference on Discrete and Computational Geometry and Graphs
  • Place of Presentation: 京都大学(京都府京都市）
  • Year and Date: 2015-09-14
  • Int'l Joint Research
• [Presentation] A Method for Generating Colorings over Graph Automorphis (2015)
  • Author(s): Fei He, H. Nagamochi
  • Organizer: The 12th International Symposium on Operations Research and its Applications in engineering, technology and management
  • Place of Presentation: Luoyang, China
  • Year and Date: 2015-08-21
  • Int'l Joint Research
• [Presentation] A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs (2015)
  • Author(s): N. Md Yunos, A. Shurbevski, H. Nagamochi
  • Organizer: The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management
  • Place of Presentation: Luoyang, China
  • Year and Date: 2015-08-21
  • Int'l Joint Research
• [Presentation] Testing Full Outer-2-Planarity in Linear Time (2015)
  • Author(s): Seok-Hee Hong, Hiroshi Nagamochi
  • Organizer: 41st International Workshop on Graph-Theoretic Concepts in Computer Science
  • Place of Presentation: Garching, Germany
  • Year and Date: 2015-06-17
  • Int'l Joint Research
• [Presentation] An Improved Algorithm for Parameterized Edge Dominating Set Problem (2015)
  • Author(s): Ken Iwaide, Hiroshi Nagamochi
  • Organizer: WALCOM 2015
  • Place of Presentation: Uttara, Dhaka,Bangladesh
  • Year and Date: 2015-02-26 – 2015-02-28
• [Presentation] Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (2014)
  • Author(s): Mingyu Xiao, Hiroshi Nagamochi
  • Organizer: ISAAC 2014
  • Place of Presentation: Jeonju, Korea
  • Year and Date: 2014-12-15 – 2014-12-17
• [Presentation] Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. (2014)
  • Author(s): Seok-Hee Hong, Hiroshi Nagamochi
  • Organizer: COCOON 2014
  • Place of Presentation: Atlanta, Georgia, USA
  • Year and Date: 2014-08-04 – 2014-08-06
• [Remarks] 離散数理研究室ホームページ
  • URL: http://www-or.amp.i.kyoto-u.ac.jp/index.html