Development of Complexity Theory for Local Search-type Computation

• Project/Area Number: 26540005
• Research Category: Grant-in-Aid for Challenging Exploratory Research
• Allocation Type: Multi-year Fund
• Research Field: Theory of informatics
• Research Institution: Nagoya University (2017); Kyushu University (2014-2016)
• Principal Investigator: Ono Hirotaka 名古屋大学, 情報学研究科, 教授 (00346826)
• Research Collaborator: Hanaka Tesshu 九州大学, 経済学府, 大学院生 ; Kiya Hironori 九州大学, 経済学府, 大学院生
• Project Period (FY): 2014-04-01 – 2018-03-31
• Project Status: Completed (Fiscal Year 2017)
• Budget Amount: ¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000); Fiscal Year 2016: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
• Keywords: 局所探索法 / アルゴリズム / 解再構成 / 再最適化 / パラメータ化アルゴリズム / 近似アルゴリズム / 計算複雑度 / 組合せ最適化 / グラフ最適化 / 近傍構造 / パラメータ化計算量 / 最適化 / 固定パラメータアルゴリズム / パラメター化計算量

Outline of Final Research Achievements

Many useful combinatorial optimization problems are known to be NP-hard or APX-hard, which means that they are difficult (probably impossible) to obtain solutions that are guaranteed to be (near) optimal in practical computational time. On the other hand, it is known that there are also good local-search type algorithms that can “usually” find sufficiently good solutions for such problems in practical running time. The goal of this research is to develop “complexity theory of local search algorithms”. We obtain many results about the reconfiguration of combinatorial optimization problems, which is also related to neighborhood operation, and also investigate the problems from the viewpoint of parameterized complexity.

Research Products

• [Int'l Joint Research] University of Waterloo(Canada)
• [Int'l Joint Research] TU Kaiserslautern(Germany)
• [Int'l Joint Research] Utrecht University(オランダ)
• [Int'l Joint Research] ユトレヒト大学(オランダ)
• [Int'l Joint Research] ウォータールー大学(カナダ)
• [Int'l Joint Research] University of Waterloo(Canada)
• [Int'l Joint Research] MIT(米国)
• [Journal Article] A faster parameterized algorithm for Pseudoforest Deletion (2018)
  • Author(s): Hans L. Bodlaender , Hirotaka Ono, Yota Otachi
  • Journal Title: Discrete Applied Mathematics Volume: 236 Pages: 42-56
  • DOI: 10.1016/j.dam.2017.10.018
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Space-Efficient Algorithms for Longest Increasing Subsequence (2018)
  • Author(s): Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer and Jun Tarui
  • Journal Title: Symposium on Theoretical Aspects of Computer Science 2018 (STACS 2018) Volume: 96
  • DOI: 10.4230/LIPIcs.STACS.2018.44
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] On Directed Covering and Domination Problems (2017)
  • Author(s): Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
  • Journal Title: International Symposium on Algorithms and Computation 2017(ISAAC 2017) Volume: 92
  • DOI: 10.4230/LIPIcs.ISAAC.2017.45
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Settlement fund circulation problem (2017)
  • Author(s): Hitoshi Hayakawa, Toshimasa Ishii，Hirotaka Ono, Yushi Uno
  • Journal Title: LIPIcs, Algorithms and Computation Volume: 92 Pages: 1-46
  • DOI: 10.4230/LIPIcs.ISAAC.2017.46
  • NAID: 120007126840
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] On the Maximum Weight Minimal Separator (2017)
  • Author(s): Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
  • Journal Title: Theory and Applications of Models of Computation 2017 (TAMC2017), Lecture Notes in Computer Science Volume: 10185 Pages: 304-318
  • DOI: 10.1007/978-3-319-55911-7_22
  • ISBN: 9783319559100, 9783319559117
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] (Total) vector domination for graphs with bounded branchwidth (2016)
  • Author(s): Toshimasa Ishii，Hirotaka Ono, Yushi Uno
  • Journal Title: Discrete Applied Mathematics Volume: 207 Pages: 88-89
  • DOI: 10.1016/j.dam.2016.03.002
  • NAID: 120006488392
  • Peer Reviewed / Open Access
• [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] The Complexity of Dominating Set Reconfiguration (2016)
  • Author(s): Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
  • Journal Title: Theoretical Computer Science Volume: 651 Pages: 37-49
  • DOI: 10.1016/j.tcs.2016.08.016
  • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] A Faster Parameterized Algorithm for Pseudoforest Deletion (2016)
  • Author(s): Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
  • Journal Title: IPEC 2016 Volume: -
  • DOI: 10.4230/LIPIcs.IPEC.2016.7
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. (2016)
  • Author(s): Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
  • Journal Title: ISAAC 2016 Volume: -
  • DOI: 10.4230/LIPIcs.ISAAC.2016.20
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation (2016)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
  • Journal Title: Theory of Computing Systems Volume: 58 Issue: 1 Pages: 60-93
  • DOI: 10.1007/s00224-014-9565-5
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Approximability of Minimum Certificate Dispersal with Tree Structures (2015)
  • Author(s): Ta. Izumi, To. Izumi, H. Ono, K. Wada
  • Journal Title: Theoretical Computer Science Volume: 591 Pages: 5-14
  • DOI: 10.1016/j.tcs.2015.01.007
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] The searchlight problem for road networks (2015)
  • Author(s): Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski
  • Journal Title: Theoretical Computer Science Volume: 591 Pages: 28-59
  • DOI: 10.1016/j.tcs.2015.04.026
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Finding All Longest Common Segments in Protein Structures Efficiently (2015)
  • Author(s): Yen Kaow Ng, Linzhi Yin, Hirotaka Ono, Shuai Cheng Li
  • Journal Title: IEEE/ACM Transactions on Computational Biology and Bioinformatics Volume: 12(3) Issue: 3 Pages: 644-655
  • DOI: 10.1109/tcbb.2014.2372782
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Linear-Time Algorithm for Sliding Tokens on Trees (2015)
  • Author(s): Erik D Demaine, Martin L Demaine, Eli Fox-Epstein, Duc A Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada
  • Journal Title: Theoretical Computer Science Volume: 600 Pages: 132-142
  • DOI: 10.1016/j.tcs.2015.07.037
  • NAID: 120006355793
  • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Pattern Formation by Oblivious Asynchronous Mobile Robots (2015)
  • Author(s): Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, and Masafumi Yamashita
  • Journal Title: SIAM Journal on Computing Volume: 44 Issue: 3 Pages: 740-785
  • DOI: 10.1137/140958682
  • Peer Reviewed
• [Journal Article] Graph Orientations Optimizing the Number of Light or Heavy Vertices (2015)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 19 Issue: 1 Pages: 441-465
  • DOI: 10.7155/jgaa.00371
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately (2015)
  • Author(s): Kazuya Haraguchi, Hirotaka Ono
  • Journal Title: Journal of Information Processing Volume: 23 Issue: 3 Pages: 276-283
  • DOI: 10.2197/ipsjjip.23.276
  • NAID: 130005070055
  • ISSN: 1882-6652
  • Peer Reviewed / Open Access
• [Journal Article] On the Parameterized Complexity for Token Jumping on Graphs (2014)
  • Author(s): Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
  • Journal Title: Theory and Applications of Models of Computation, Lecture Notes in Computer Science Volume: 8402 Pages: 341-351
  • DOI: 10.1007/978-3-319-06089-7_24
  • NAID: 120005850323
  • ISBN: 9783319060880, 9783319060897
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Polynomial-Time Algorithm for Sliding Tokens on Trees (2014)
  • Author(s): Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
  • Journal Title: Lecture Notes in Computer Science Volume: 8889 Pages: 389-400
  • DOI: 10.1007/978-3-319-13075-0_31
  • NAID: 120005850324
  • ISBN: 9783319130743, 9783319130750
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Fixed-Parameter Tractability of Token Jumping on Planar Graphs (2014)
  • Author(s): Takehiro Ito, Marcin Kaminski, Hirotaka Ono
  • Journal Title: Lecture Notes in Computer Science Volume: 8889 Pages: 208-219
  • DOI: 10.1007/978-3-319-13075-0_17
  • ISBN: 9783319130743, 9783319130750
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Algorithmic aspects of distance constrained labeling: a survey (2014)
  • Author(s): Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
  • Journal Title: International Journal of Networking and Computing Volume: 4(2) Pages: 251-259
  • NAID: 130004709087
  • Peer Reviewed
• [Presentation] Space-Efficient Algorithms for Longest Increasing Subsequence (2018)
  • Author(s): Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer and Jun Tarui
  • Organizer: Symposium on Theoretical Aspects of Computer Science 2018 (STACS 2018)
  • Int'l Joint Research
• [Presentation] Space-Efficient Algorithms for Longest Increasing Subsequence (2018)
  • Author(s): Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer and Jun Tarui
  • Organizer: 電子情報通信学会 コンピュテーション研究会
  • Invited
• [Presentation] 外平面グラフに対するKollerの L(2,1)ラベリングアルゴリズムの計 算時間解析とその改善 (2017)
  • Author(s): 山中寿登，小野廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会2017年春季研究発表会
  • Place of Presentation: 沖縄県市町村自治会館（沖縄県那覇市）
  • Year and Date: 2017-03-15
• [Presentation] 制約辺付きd-クラスタ編集問題に 対する FPTアルゴリズム (2017)
  • Author(s): 大迫俊輔，小野廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会2017年春季研究発表会
  • Place of Presentation: 沖縄県市町村自治会館（沖縄県那覇市）
  • Year and Date: 2017-03-15
• [Presentation] 閾値グラフに対する標的集合選択問題 (2017)
  • Author(s): 山下智大，小野廣隆
  • Organizer: 火の国情報シンポジウム2017
  • Place of Presentation: 鹿児島大学（鹿児島市）
  • Year and Date: 2017-03-01
• [Presentation] On Directed Covering and Domination Problems (2017)
  • Author(s): Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
  • Organizer: International Symposium on Algorithms and Computation 2017(ISAAC 2017)
  • Int'l Joint Research
• [Presentation] Settlement Fund Circulation Problem (2017)
  • Author(s): Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
  • Organizer: International Symposium on Algorithms and Computation 2017(ISAAC 2017)
  • Int'l Joint Research
• [Presentation] On the Maximum Weight Minimal Separator (2017)
  • Author(s): Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
  • Organizer: Theory and Applications of Models of Computation 2017 (TAMC2017)
  • Int'l Joint Research
• [Presentation] 有向辺支配集合問題に対する固定パラメータアルゴリズム (2017)
  • Author(s): 土中 哲秀（研究協力者）
  • Organizer: WOO @つくば 未来を担う若手研究者の集い 2017
• [Presentation] 二人単貧民の必勝判定に関する考察 (2017)
  • Author(s): 木谷 裕紀（研究協力者）
  • Organizer: WOO @つくば 未来を担う若手研究者の集い 2017
• [Presentation] 三角形総個数最大化問題 (2017)
  • Author(s): 西島歩美,江藤宏,土中哲秀,宮野英次,小野廣隆,大舘陽太,斎藤寿樹,上原隆平,Tom C. van der Zanden
  • Organizer: 日本オペレーションズ・リサーチ学会 九州支部 九州地区における OR 若手研究交流会
• [Presentation] 二人単貧民の完全解析とその拡張 (2017)
  • Author(s): 木谷 裕紀, 小野 廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会 九州支部 九州地区における OR 若手研究交流会
• [Presentation] ネットワークの社会的距離に基づく最適分割 (2017)
  • Author(s): 大久保壮浩,土中哲秀,小野廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会 九州支部 九州地区における OR 若手研究交流会
• [Presentation] Simple-Kalah における勝敗確定の十分条件 (2017)
  • Author(s): 前井康秀,小野廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会 九州支部 九州地区における OR 若手研究交流会
• [Presentation] 渋滞シミュレーションにおけるカーナビ搭載の影響について (2017)
  • Author(s): 國廣隼平,小野廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会 九州支部 九州地区における OR 若手研究交流会
• [Presentation] 単位円グラフの L(2,1)-ラベリングのための近似アルゴリズム (2017)
  • Author(s): 山中 寿登, 小野 廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会 九州支部 九州地区における OR 若手研究交流会
• [Presentation] 有向支配集合問題に関する考察 (2017)
  • Author(s): 土中哲秀,Nishimura Naomi,小野廣隆
  • Organizer: 日本オペレーションズ・リサーチ学会 九州支部 九州地区における OR 若手研究交流会
• [Presentation] 単位円グラフの L(2,1)-ラベリングのための近似アルゴリズム (2017)
  • Author(s): 山中 寿登, 小野 廣隆
  • Organizer: 第13回情報科学ワークショップ
• [Presentation] On Directed Covering and Domination Problems (2017)
  • Author(s): 土中 哲秀, 小野 廣隆
  • Organizer: 第13回情報科学ワークショップ
• [Presentation] 2 人単貧民の必勝判定アルゴリズム (2017)
  • Author(s): 木谷 裕紀, 小野 廣隆
  • Organizer: 第13回情報科学ワークショップ
• [Presentation] コード配色の変更を認めるマスターマインドの最適な推測回数 (2017)
  • Author(s): 迫田 賢宜, 小野 廣隆
  • Organizer: 第13回情報科学ワークショップ
• [Presentation] ation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. (2016)
  • Author(s): Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
  • Organizer: ISAAC 2016
  • Place of Presentation: Sydney, Australia
  • Year and Date: 2016-12-12
  • Int'l Joint Research
• [Presentation] A Faster Parameterized Algorithm for Pseudoforest Deletion (2016)
  • Author(s): Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
  • Organizer: IPEC 2016
  • Place of Presentation: Aarhus, Denmark
  • Year and Date: 2016-08-24
  • Int'l Joint Research
• [Presentation] The Complexity of Dominating Set Reconfiguration (2015)
  • Author(s): Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
  • Organizer: Algorithms and Data Structures - 14th International Symposium, WADS 2015
  • Place of Presentation: Victoria, BC, Canada
  • Year and Date: 2015-08-05
  • Int'l Joint Research
• [Presentation] Subgraph domatic problem and writing capacity of memory devices with restricted state transitions (2015)
  • Author(s): Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
  • Organizer: IEEE International Symposium on Information Theory, ISIT 2015
  • Place of Presentation: Hong Kong
  • Year and Date: 2015-06-14
  • Int'l Joint Research
• [Presentation] Reconfiguration of Cliques in a Graph (2015)
  • Author(s): Takehiro Ito, Hirotaka Ono, Yota Otachi
  • Organizer: Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015
  • Place of Presentation: Singapore
  • Year and Date: 2015-05-18
  • Int'l Joint Research
• [Presentation] A Fixed-Parameter Algorithm for Max Edge Domination (2015)
  • Author(s): Tesshu Hanaka, Hirotaka Ono
  • Organizer: the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015)
  • Place of Presentation: Pec pod Snezkou, Czech Republic
  • Year and Date: 2015-01-24 – 2015-01-29
• [Presentation] Polynomial-Time Algorithm for Sliding Tokens on Trees (2014)
  • Author(s): Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
  • Organizer: Algorithms and Computation - 25th International Symposium, ISAAC 2014
  • Place of Presentation: Jeonju, Korea
  • Year and Date: 2014-12-15 – 2014-12-17
• [Presentation] Fixed-Parameter Tractability of Token Jumping on Planar Graphs (2014)
  • Author(s): Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono
  • Organizer: Algorithms and Computation - 25th International Symposium, ISAAC 2014
  • Place of Presentation: Jeonju, Korea
  • Year and Date: 2014-12-15 – 2014-12-17
• [Presentation] On the Parameterized Complexity for Token Jumping on Graphs. (2014)
  • Author(s): Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
  • Organizer: Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014
  • Place of Presentation: Chennai, India
  • Year and Date: 2014-04-11 – 2014-04-13