Studies on graph theoretical approaches for robust network design and its generalizations

• Project/Area Number: 24700001
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Fundamental theory of informatics
• Research Institution: Hokkaido University
• Principal Investigator: Ishii Toshimasa 北海道大学, 経済学研究科(研究院), 准教授 (30324487)
• Project Period (FY): 2012-04-01 – 2016-03-31
• Project Status: Completed (Fiscal Year 2015)
• Budget Amount: ¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000); Fiscal Year 2015: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2013: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000); Fiscal Year 2012: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
• Keywords: 組合せ最適化 / 離散最適化 / アルゴリズム / ネットワーク設計 / グラフ理論

Outline of Final Research Achievements

In modern society, we have many networks such as traffic networks and communication networks. It is required that such networks have some fault-tolerance, because we have many natural disasters such as earthquake and flood in Japan. In this research, we proposed several efficient algorithms for the control and design of robust networks. Also, we extended these results, which may contribute to the analysis of other general problems.

Research Products

• [Journal Article] Subexponential fixed-parameter algroithms for partial vector domination (2016)
  • Author(s): Toshimasa Ishii，Hirotaka Ono, Yushi Uno
  • Journal Title: Discrete Optimization Volume: 22 Pages: 111-121
  • DOI: 10.1016/j.disopt.2016.01.003
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] 正モジュラ関数の最適化 (2015)
  • Author(s): 石井 利昌，牧野 和久
  • Journal Title: FIT2015 (第14回情報科学技術フォーラム) 講演論文集 Volume: 1 Pages: 1-6
  • Peer Reviewed / Open Access
• [Journal Article] Algorithmic aspects of distance constrained labeling: a survey (2014)
  • Author(s): T. Hasunuma, T. Ishii, H. Ono, Y. Uno
  • Journal Title: International Journal of Networking and Computing Volume: 4 Pages: 251-259
  • NAID: 130004709087
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Subexponential fixed-parameter algroithms for partial vector domination (2014)
  • Author(s): T. Ishii, H. Ono, Y. Uno
  • Journal Title: 3rd International Symposium on Combinatorial Optimization (ISCO 2014) Volume: - Pages: 292-304
  • DOI: 10.1007/978-3-319-09174-7_25
  • ISBN: 9783319091730, 9783319091747
  • Peer Reviewed
• [Journal Article] (Total) vector domination for graphs with bounded branchwidth (2014)
  • Author(s): T. Ishii，H. Ono, and Y. Uno
  • Journal Title: 11th Latin American Theoretical Informatics Symposium (LATIN 2014) Volume: - Pages: 238-249
  • DOI: 10.1007/978-3-642-54423-1_21
  • NAID: 120006488392
  • ISBN: 9783642544224, 9783642544231
  • Peer Reviewed
• [Journal Article] Augmenting edge-connectivity between vertex subsets (2013)
  • Author(s): T. Ishii，K. Makino
  • Journal Title: Algorithmica Volume: - Issue: 1 Pages: 130-147
  • DOI: 10.1007/s00453-012-9724-5
  • NAID: 110007081988
  • Peer Reviewed
• [Journal Article] Augmenting outerplanar graphs to meet diameter requirements (2013)
  • Author(s): T. Ishii
  • Journal Title: Journal of Graph Theory Volume: 74 Issue: 4 Pages: 392-416
  • DOI: 10.1002/jgt.21719
  • Peer Reviewed
• [Journal Article] A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs (2012)
  • Author(s): Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
  • Journal Title: Journal of Discrete Algorithms Volume: (掲載決定済) Pages: 189-206
  • DOI: 10.1016/j.jda.2011.12.020
  • NAID: 110008000714
  • Peer Reviewed
• [Journal Article] The (p, q)-total labeling problem for trees (2012)
  • Author(s): Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
  • Journal Title: Discrete Mathematics Volume: vol.312 Issue: 8 Pages: 1407-1420
  • DOI: 10.1016/j.disc.2012.01.007
  • NAID: 110007995637
  • Peer Reviewed
• [Journal Article] Graph Augmentation Problem with Diameter Requirements (2012)
  • Author(s): T. Ishii
  • Journal Title: Third International Conference on Networking and Computing, ICNC 2012 Volume: - Pages: 393-398
  • DOI: 10.1109/icnc.2012.75
  • Peer Reviewed
• [Journal Article] A linear time algorithm for L(2, 1)-labeling of trees (2012)
  • Author(s): Hasunuma T., Ishii T., Ono H., Uno Y.
  • Journal Title: Algorithmica Volume: (印刷中) Issue: 3 Pages: 654-681
  • DOI: 10.1007/s00453-012-9657-z
  • NAID: 110007995596
  • Peer Reviewed
• [Presentation] 正モジュラ関数の最適化 (2015)
  • Author(s): 石井 利昌，牧野 和久
  • Organizer: FIT2015 (第14回情報科学技術フォーラム)
  • Place of Presentation: 愛媛大学城北キャンパス (愛媛県松山市)
  • Year and Date: 2015-09-15
• [Presentation] (Total) vector domination for graphs with bounded branchwidth (2014)
  • Author(s): Toshimasa Ishii
  • Organizer: アルゴリズム研究会 (情報処理学会)
  • Place of Presentation: 道後温泉大和屋 (愛媛県松山市)
  • Year and Date: 2014-06-13 – 2014-06-14
• [Presentation] Subexponential fixed-parameter algroithms for partial vector domination (2014)
  • Author(s): T.Ishii，H. Ono, and Y. Uno
  • Organizer: 3rd International Symposium on Combinatorial Optimization (ISCO 2014)
  • Place of Presentation: Radisson Blu Hotel (ポルトガル，リスボン)
• [Presentation] (Total) vector domination for graphs with bounded branchwidth (2014)
  • Author(s): T.Ishii，H. Ono, and Y. Uno
  • Organizer: 11th Latin American Theoretical Informatics Symposium (LATIN 2014)
  • Place of Presentation: Four Points by Sheraton (ウルグアイ，モンテビデオ)
• [Presentation] 連結度制約をもつネットワーク構成問題 (2013)
  • Author(s): 石井利昌
  • Organizer: 京都大学数理解析研究所「組合せ最適化セミナー」
  • Place of Presentation: 京都大学数理解析研究所 (京都市)
  • Invited
• [Presentation] Graph Augmentation Problem with Diameter Requirements (2012)
  • Author(s): T. Ishii
  • Organizer: Third International Conference on Networking and Computing, ICNC 2012
  • Place of Presentation: 沖縄男女共同参画センター(沖縄県)