Studies on algorithms for large-scale discrete generation problems

• Project/Area Number: 18680002
• Research Category: Grant-in-Aid for Young Scientists (A)
• Allocation Type: Single-year Grants
• Research Field: Fundamental theory of informatics
• Research Institution: The University of Tokyo
• Principal Investigator: MAKINO Kazuhisa The University of Tokyo, 大学院・情報理工学系研究科, 准教授 (60294162)
• Project Period (FY): 2006 – 2008
• Project Status: Completed (Fiscal Year 2008)
• Budget Amount: ¥15,990,000 (Direct Cost: ¥12,300,000、Indirect Cost: ¥3,690,000); Fiscal Year 2008: ¥5,850,000 (Direct Cost: ¥4,500,000、Indirect Cost: ¥1,350,000); Fiscal Year 2007: ¥5,850,000 (Direct Cost: ¥4,500,000、Indirect Cost: ¥1,350,000); Fiscal Year 2006: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
• Keywords: アルゴリズム / 列挙 / ネットワーク / 信頼性 / 双対性判定 / マトロイド

Research Abstract

本研究では,ネットワークの信頼度設計に関連する列挙問題,および,単調論理関数の双対化問題に関連する代表的な列挙問題に対する効率的なアルゴリズムの開発に成功した.また関連するいくつかの問題が計算量的に困難であることを示した.

Research Products

• [Journal Article] A Fast and Simple Parallel Algorithm for the Monotone Duality Problem, ICALP 2009 (2009)
  • Author(s): E. Boros, K. Makino
  • Journal Title: Lecture Notes in Computer Science Vol.5555 Pages: 183-194
  • Peer Reviewed
• [Journal Article] Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs (2009)
  • Author(s): K. Elbassioni, K. Makino, I. Rauf
  • Journal Title: ESA 2009, Lecture Notes in Computer Science Vol.5757 Pages: 143-154
  • Peer Reviewed
• [Journal Article] A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (2009)
  • Author(s): E.Boros, K.Makino
  • Journal Title: ICALP 2009, Lecture Notes in computer Science 5555 Pages: 183-194
  • Peer Reviewed
• [Journal Article] Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs (2009)
  • Author(s): Khaled Elbassioni, Kazuhisa Makino, Imran Rauf
  • Journal Title: ESA 2009, Lecture Notes in computer Science 5757 Pages: 143-154
  • Peer Reviewed
• [Journal Article] Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (2007)
  • Author(s): L. Khachiyan, E. Boros, K. Elbassinoi, V. Gurvich, K. Makino
  • Journal Title: Theoretical Computer Science Vol.379 Pages: 361-376
  • Peer Reviewed
• [Journal Article] Generating Minimal k-Vertex Connected Spanning Subgraphs (2007)
  • Author(s): L. Khachiyan, K. Borys, E. Boros, K. Elbassinoi, V. Gurvich, K. Makino, G. Rudolf
  • Journal Title: COCOON 2007, LNCS Vol.4598 Pages: 222-231
  • Peer Reviewed
• [Journal Article] Finding Intersections of Bichromatic Segments Defined by Points (2007)
  • Author(s): A. Elmasry, K. Makino
  • Journal Title: CCCG 2007 Vol.19 Pages: 269-272
  • Peer Reviewed
• [Journal Article] Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (2007)
  • Author(s): L. Khachiyan, E. Boros, K. Elbassioni, V. Gurvich, K. Makino
  • Journal Title: Discrete Applied Mathematics Vol.155 Pages: 137-149
  • Peer Reviewed
• [Journal Article] Enumerating Spanning and Connected Subsets in Graphs and Matroids (2007)
  • Author(s): L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich, K. Makino
  • Journal Title: ESA 2006, Lecture Notes in Computer Science Vol.155 Pages: 444-455
  • Peer Reviewed
• [Journal Article] Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. (2007)
  • Author(s): L. Khachiyan, E. Boros, K. Elbassinoi, V. Gurvich, K. Makino
  • Journal Title: Theoretical Computer Science 379 Pages: 361-376
  • Peer Reviewed
• [Journal Article] Generating Minimal k-Vertex Connected Spanning Subgraphs (2007)
  • Author(s): L. Khachiyan, K. Borys, E. Boros, K. Elbassinoi, V. Gurvich, K. Makino, G. Rudolf
  • Journal Title: COCOON 2007, LNCS 4598 Pages: 222-231
  • Peer Reviewed
• [Journal Article] Finding Intersections of Bichromatic Segments Defined by Points (2007)
  • Author(s): A. Elmasry, K. Makino
  • Journal Title: CCCG 2007 19 Pages: 269-272
  • Peer Reviewed
• [Journal Article] Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (2007)
  • Author(s): L.Khachiyan, E.Boros, K.Elbassioni, V.Gurvich, K.Makino
  • Journal Title: Discrete Applied Mathematics 155 Pages: 137-149
• [Journal Article] Enumerating Spanning and Connected Subsets in Graphs and Matroids (2007)
  • Author(s): L.Khachiyan, E.Boros, K.Borys, K.Elbassioni, V.Gurvich, K.Makino
  • Journal Title: ESA 2006, Lecture Notes in Computer Science 155 Pages: 444-455