1991 Fiscal Year Annual Research Report

離散構造の効率的処理アルゴリズムに関する総合的研究

Research Project

Project/Area Number	02302047
Research Institution	Tohoku University
Principal Investigator	西関隆夫東北大学, 工学部, 教授 (80005545)
Co-Investigator(Kenkyū-buntansha)	渡辺敏正広島大学, 工学部, 助教授 (80112184) 平田富夫名古屋大学, 工学部, 助教授 (10144205) 萩原兼一大阪大学, 基礎工学部, 助教授 (00133140) 加藤直樹神戸商科大学, 管理科学科, 教授 (40145826) 今井浩東京大学, 理学部, 助教授 (80183010)
Keywords	アルゴリズム / 並列処理 / 組合せ問題 / 離散構造 / 計算幾何学 / ネットワ-ク / 分散処理
Research Abstract	平成2年度において得られた研究成果を土台として,総合的見地から種々の新しいアルゴリズムを設計解析した.その発表と活発な討論により,現在から将来に向け有用となる近似・確率・並列・分散・ハ-ドウェアアルゴリズムに関する新しい知見を得るに至った.さらに計算理論に関する成果も種々得られた.代表的な成果を以下に示す. 1.VLSIのレイアウト設計における重要な問題の一つに回路分割問題があり,これまでに様々なアルゴリズムが提案されてきている.本研究では回路を構成するモジュ-ルの集合とネットリストが与えられたとき,モジュ-ル集合を2分割して左右の部分の面積をほぼ等しくし,かつ両方の部分に跨る配線の本数を最小にする問題に関するアルゴリズムを与えた.グラフの表現に基づいた方法と平面上の点集合に写像した上で点集合の2分割問題を解く方法を比較した.この結果はアルゴリズムを構成するときにグラフモデルと幾何モデルのいずれを用いるかを決定するために有用である. 2.NP完全問題などの複雑さの高い問題に対して,平均時間には効率良く解くと主張されるアルゴリズムが数多く開発されている.それらの評価は通常解析的になされるが,実際的立場の研究者からは,実際に計算機実験によっても行われるべきだとの指摘がある.本研究では充足可能性問題に対するこのようなアルゴリズムの評価に用いるべき例題生成はいかにあるべきかについて調査・検討した.さらに,その要求を満足するような例題生成アルゴリズムが存在することを示した.

Research Products
(33 results)

All Other

All Publications (33 results)

[Publications] Takao Asano: "Dynamic programming on intervals" Proc of 2nd International Symp.on Algorithms Lecture Notes in Computer Science. 557. 199-207 (1991)
[Publications] Tetsuo Asano: "Circuit partitioning algorithms:Graph model versus geomtry model" Proc.of 2nd International Symp.on Algorithms Lecture Notes in Computer Science. 557. 94-103 (1991)
[Publications] Tetsuo Asano: "Walking on an arrangement to pologically" Proc.7th annual Symp.on Computafional Geometry. 7. 297-306 (1991)
[Publications] Yoshihide Igarashi: "Optimal schemes for desseminating information and their fault tolerance" IEICE Trans.Inf.and Syst.E75ーD. 22-29 (1992)
[Publications] A.Aggarwal: "Finding κ points with minimum diameter and related problems" Journal of Algorithms. 12. 38-56 (1991)
[Publications] Hiroshi Imai: "A geometric fitting problem of two corresponding sets of points on a line" IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences. E74. 665-668 (1991)
[Publications] Hiroshi Imai: "On the polyromiality of the multiplicative penalty function method for linear programming and related inscribed ellipsolds" IEICE Transactions on Fundamentals of Electronics.Communications and Computer Sciences. E74. 669-671 (1991)
[Publications] T.Akutsu: "The sum of smaller endpoint degree over edges of graphs and its applications to geometric problems" Proceedings of the 3nd Canadiam Conference on Computational Geometry. 3. 145-148 (1991)
[Publications] 岩本: "組合せ問題に対するRS型ベクトルアルゴリズム" 電子情報通信学会論文誌. J75ーDーI. (1992)
[Publications] Kazuo Iwama: "ASPACE(o(loglog n))is regular" SIAM J.Computing.
[Publications] T.Ichimori: "A twoーcommodity sharing problem on networks" Networks. 21. 547-563 (1991)
[Publications] 加藤直樹: "パラメトリック組合せ最適化問題とその応用" 電子情報通信学会誌. 74. 949-956 (1991)
[Publications] 木庭: "デ-タベ-スシステムにおける動的な版の選択を行うκ版先読みスケジュ-ラ" 電子情報通信学会論文誌. J74ーDーI. 858-868 (1991)
[Publications] Naoki Katoh: "An εーapproximation scheme for combinatorial optimization problems with minimum variance criterion" Discrete Applied Mathematics. 35. 131-141 (1992)
[Publications] Naoki Katoh: "A fully polynomial time approximation scheme for minimum costーreliability ratio problems" Discrete Applied Mathematics. 35. 143-155 (1992)
[Publications] Xiao Zhou: "An efficient algorithm for edgeーcoloring seriesーparallel multigraphs" Proceedings of 1st Latin American Theoretical Informatics Lecture Notes in Computer Science. (1992)
[Publications] Hitoshi Suzuki: "A variableーpriority queue and doughnut routing" Journal of Algorithms.
[Publications] Shinichi Nakano: "Scheduling file transfers under port and channel constraints" Proc.of 2nd International Symposium on Algorithms Lecture Notes in Computer Science. 557. 43-51 (1991)
[Publications] Naoyoshi Kanamaru: "Efficient enumeration of grid points in a polygon and its application to integer programming" Proc.of 2nd Conf.on Integer Programming and Combinatorial Optimization.
[Publications] 中野眞一: "グラフをfg採色する近似アルゴリズム" 日本応用数学会論文誌. 1. 195-211 (1991)
[Publications] A.Frank: "Algorithms for routing around a rectangle" Discrete Applied Mathematics.
[Publications] X.Tan: "The intersection searching problem for cーoriented polygons" Information Processing Letters. 37. 201-204 (1991)
[Publications] X.Tan: "An incremental algorithm for constructing shortest watchman routs" Proc of 2nd International symposium on Algorithms Lecture Notes in Computer Science. 557. 163-175 (1991)
[Publications] X.Tan: "On translating a set of cーoriented faces in three dimensions" Trans.of IEICE.
[Publications] 太郎良: "木パタ-ンマッチングのための並列アルゴリズム" 電子情報通信学会論文誌.
[Publications] 大村: "組合せ回路の機能情報抽出" 電子情報通信学会論文誌. J74ーA. 247-255 (1991)
[Publications] Hiroto Yasuura: "Local computable coding for unary operations" Lecture Notes in Computer Science. 491. 312-323 (1991)
[Publications] Osamu Watanabe: "On intractability of the class UP" Math.System Theory. 24. 1-10 (1991)
[Publications] M.Ogiwara: "On polynomialーtime bounded truthーtable reducibility of NP sets to sparse sets" SIAM J.Comput.20. 471-483 (1991)
[Publications] R.Gavalda^^｀: "On the computational complexity of small descriptions" SIAM J.Comput.
[Publications] T.Watanabe: "Proof procedures and axiom set in petrinet models of horn clause propositional logic" IEEE ISCAS. 2/5. 914-917 (1991)
[Publications] T.Watanabe: "A linear time augmenting algorithm for 3ーedgeーconnectivity augmentation problems" IEEE ISCAS. 2/5. 1168-1171 (1991)
[Publications] 梅尾博司: "超並列計算機ア-キテクチャとそのアルゴリズム" 共立出版, 216 (1991)

1991 Fiscal Year Annual Research Report

離散構造の効率的処理アルゴリズムに関する総合的研究

Principal Investigator

西関 隆夫 東北大学, 工学部, 教授 (80005545)

Research Products

[Publications] Takao Asano: "Dynamic programming on intervals" Proc of 2nd International Symp.on Algorithms Lecture Notes in Computer Science. 557. 199-207 (1991)

[Publications] Tetsuo Asano: "Circuit partitioning algorithms:Graph model versus geomtry model" Proc.of 2nd International Symp.on Algorithms Lecture Notes in Computer Science. 557. 94-103 (1991)

[Publications] Tetsuo Asano: "Walking on an arrangement to pologically" Proc.7th annual Symp.on Computafional Geometry. 7. 297-306 (1991)

[Publications] Yoshihide Igarashi: "Optimal schemes for desseminating information and their fault tolerance" IEICE Trans.Inf.and Syst.E75ーD. 22-29 (1992)

[Publications] A.Aggarwal: "Finding κ points with minimum diameter and related problems" Journal of Algorithms. 12. 38-56 (1991)

[Publications] Hiroshi Imai: "A geometric fitting problem of two corresponding sets of points on a line" IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences. E74. 665-668 (1991)

[Publications] Hiroshi Imai: "On the polyromiality of the multiplicative penalty function method for linear programming and related inscribed ellipsolds" IEICE Transactions on Fundamentals of Electronics.Communications and Computer Sciences. E74. 669-671 (1991)

[Publications] T.Akutsu: "The sum of smaller endpoint degree over edges of graphs and its applications to geometric problems" Proceedings of the 3nd Canadiam Conference on Computational Geometry. 3. 145-148 (1991)

[Publications] 岩本: "組合せ問題に対するRS型ベクトルアルゴリズム" 電子情報通信学会論文誌. J75ーDーI. (1992)

[Publications] Kazuo Iwama: "ASPACE(o(loglog n))is regular" SIAM J.Computing.

[Publications] T.Ichimori: "A twoーcommodity sharing problem on networks" Networks. 21. 547-563 (1991)

[Publications] 加藤 直樹: "パラメトリック組合せ最適化問題とその応用" 電子情報通信学会誌. 74. 949-956 (1991)

[Publications] 木庭: "デ-タベ-スシステムにおける動的な版の選択を行うκ版先読みスケジュ-ラ" 電子情報通信学会論文誌. J74ーDーI. 858-868 (1991)

[Publications] Naoki Katoh: "An εーapproximation scheme for combinatorial optimization problems with minimum variance criterion" Discrete Applied Mathematics. 35. 131-141 (1992)

[Publications] Naoki Katoh: "A fully polynomial time approximation scheme for minimum costーreliability ratio problems" Discrete Applied Mathematics. 35. 143-155 (1992)

[Publications] Xiao Zhou: "An efficient algorithm for edgeーcoloring seriesーparallel multigraphs" Proceedings of 1st Latin American Theoretical Informatics Lecture Notes in Computer Science. (1992)

[Publications] Hitoshi Suzuki: "A variableーpriority queue and doughnut routing" Journal of Algorithms.

[Publications] Shinichi Nakano: "Scheduling file transfers under port and channel constraints" Proc.of 2nd International Symposium on Algorithms Lecture Notes in Computer Science. 557. 43-51 (1991)

[Publications] Naoyoshi Kanamaru: "Efficient enumeration of grid points in a polygon and its application to integer programming" Proc.of 2nd Conf.on Integer Programming and Combinatorial Optimization.

[Publications] 中野 眞一: "グラフをfg採色する近似アルゴリズム" 日本応用数学会論文誌. 1. 195-211 (1991)

[Publications] A.Frank: "Algorithms for routing around a rectangle" Discrete Applied Mathematics.

[Publications] X.Tan: "The intersection searching problem for cーoriented polygons" Information Processing Letters. 37. 201-204 (1991)

[Publications] X.Tan: "An incremental algorithm for constructing shortest watchman routs" Proc of 2nd International symposium on Algorithms Lecture Notes in Computer Science. 557. 163-175 (1991)

[Publications] X.Tan: "On translating a set of cーoriented faces in three dimensions" Trans.of IEICE.

[Publications] 太郎 良: "木パタ-ンマッチングのための並列アルゴリズム" 電子情報通信学会論文誌.

[Publications] 大村: "組合せ回路の機能情報抽出" 電子情報通信学会論文誌. J74ーA. 247-255 (1991)

[Publications] Hiroto Yasuura: "Local computable coding for unary operations" Lecture Notes in Computer Science. 491. 312-323 (1991)

[Publications] Osamu Watanabe: "On intractability of the class UP" Math.System Theory. 24. 1-10 (1991)

[Publications] M.Ogiwara: "On polynomialーtime bounded truthーtable reducibility of NP sets to sparse sets" SIAM J.Comput.20. 471-483 (1991)

[Publications] R.Gavalda^^｀: "On the computational complexity of small descriptions" SIAM J.Comput.

[Publications] T.Watanabe: "Proof procedures and axiom set in petrinet models of horn clause propositional logic" IEEE ISCAS. 2/5. 914-917 (1991)

[Publications] T.Watanabe: "A linear time augmenting algorithm for 3ーedgeーconnectivity augmentation problems" IEEE ISCAS. 2/5. 1168-1171 (1991)

[Publications] 梅尾 博司: "超並列計算機ア-キテクチャとそのアルゴリズム" 共立出版, 216 (1991)

西関隆夫東北大学, 工学部, 教授 (80005545)

[Publications] 加藤直樹: "パラメトリック組合せ最適化問題とその応用" 電子情報通信学会誌. 74. 949-956 (1991)

[Publications] 中野眞一: "グラフをfg採色する近似アルゴリズム" 日本応用数学会論文誌. 1. 195-211 (1991)

[Publications] 太郎良: "木パタ-ンマッチングのための並列アルゴリズム" 電子情報通信学会論文誌.

[Publications] 梅尾博司: "超並列計算機ア-キテクチャとそのアルゴリズム" 共立出版, 216 (1991)