| Project/Area Number |
13480081
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
IWAMA Kazuo KYOTO UNIVERSITY, Graduate School of Informatics, Professor, 情報学研究科, 教授 (50131272)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MIYAZAKI Shuichi KYOTO UNIVERSITY, Academic Center for Computing and Media Studies, Associate Professor, 学術情報メディアセンター, 助教授 (00303884)
ITO Hiro KYOTO UNIVERSITY, Graduate School of Informatics, Associate Professor, 情報学研究科, 助教授 (50283487)
OKABE Yasuo KYOTO UNIVERSITY, Academic Center for Computing and Media Studies, Professor, 学術情報メディアセンター, 教授 (20204018)
HORIYAMA Takashi KYOTO UNIVERSITY, Graduate School of Informatics, Research Associate, 情報学研究科, 助手 (60314530)
|
|---|
| Project Period (FY) |
2001 – 2003
|
| Project Status |
Completed (Fiscal Year 2003)
|
| Budget Amount *help |
¥12,100,000 (Direct Cost: ¥12,100,000)
Fiscal Year 2003: ¥3,200,000 (Direct Cost: ¥3,200,000)
Fiscal Year 2002: ¥3,600,000 (Direct Cost: ¥3,600,000)
Fiscal Year 2001: ¥5,300,000 (Direct Cost: ¥5,300,000)
|
|---|
| Keywords | Discrete Algorithms / Discrete Optimization / Stable Marriage Problems / Approximation Algorithms / Online Algorithms / Satisfiability Problems / Computational Complexity / Network Algorithms / 工学的評価基準 / 安定結婚問題 / ネットワークルーティング / レンタルスキー問題 / 平均的競合比 / 最悪競合比 / インターネット / 経路ループ回避 / コンパクトルーティング / 格子状ネットワーク / 伸張係数 / 安定マッチング / 確率アルゴリズム |
|---|
| Research Abstract |
Discrete algorithms have been evaluated by the unique measure 'asymptotic time complexity' for many cases. Recently, however, many other measures have been proposed, e.g., the approximation ratios for solving combinatorial problems approximately, and the competitive ratios for solving online problems in which we have no information on the future inputs. In this research, we studied these new measures as the criteria based on engineering requirements, and developed the methodologies for qualifying algorithms from this point of view.
As to the stable marriage problems, it is known to be solvable in polynomial time. We have generalized the problem, and proved that it is also solvable in polynomial time even when ties in the lists or incomplete lists are allowed. While we proved the intractability for the case both ties and incompleteness are allowed, we proposed an approximation algorithm that achieves an approximation ratio less than 2.
As to the satisfiability problems, we developed a 1.324^n algorithm for 3-SAT by complementarily combining two types of algorithms based on, the local search and the backtracking. We also considered condensing the density (i.e., the ratio of satisfying assignments to the 2^n assignments) of formulas.
Other research topics are as follows ; online algorithms, network algorithms, quantum algorithms.
|
