• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2000 Fiscal Year Final Research Report Summary

Designing Efficient Discrete Algorithms with High Quality and High Performance

Research Project

Project/Area Number 10680364
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field 計算機科学
Research InstitutionChuo University

Principal Investigator

ASANO Takao  Chuo University, Faculty of Science and Engineering Professor, 理工学部, 教授 (90124544)

Project Period (FY) 1998 – 2000
KeywordsMAXSAT / discrete algorithm / approximation algorithm / network design / facility location / VLSI layout
Research Abstract

The objective of this research is to do research on efficient discrete algorithms with high quality and high performance from both theoretical and practical points of view and to contribute to the development of algorithmic researches which will be one of the important information technologies in the 21st centuary. To achieve this objective, we have done the following researches.
I made an investigation on important techniques developed for designing algorithms which are not only efficient but also of high qaulity and of high performance in the fields of computational geometry, graph-network algorithms, combinatorial optimization, parallel and distributed algorithms and so on. Especially based on the semidefinte programming and network-flow techniques, I made an investigation on discrete algorithms with high performance by exchanging ideas with leading researchers in the world. Throught this investigation, I could propose efficient algorithms with high qaulity and high performance in the fields of VLSI design, information networks and real world applications. Specifically, for the maximum satisfiability problem, I proposed a new algorithm with the world best record in the performance. I also implemented the algorithms with the helps of students as well as algorithms previously proposed by other researchers and made computational experiments in order to evaluate the new algorithms not only from the theoretical point of view but also from the practical point of view. The results in this research were published in the world leading journals and symposia. In view of this, the objective of this research can be said to be satisfatorily achieved.

  • Research Products

    (18 results)

All Other

All Publications (18 results)

  • [Publications] Asano Takao: "Approximation algorithms for the maximum power consumption problem on combinational circuits"Proc.11th International Symposium on Algorithms and Computation. 11. 204-215 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 浅野孝夫: "半正定値計画法を用いた近インメアルゴリズム"オペレーションズ・リサーチ. 45・10. 520-527 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Asano Takao: "Recent developments in maximum flow algorithms"Journal of Operations Research Society of Japan. 43・1. 2-31 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Asano Takao: "De Signing high-quality approximation algorithms for combinatorial optimization problems"IEICE Transactions on Information and Systems. E83・3. 462-479 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Asano Takao: "Improved approximation algorithms for MAX SAT"Proc.11th ACM-SIAM Symposium on Discrete Algorithms. 11. 96-105 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Asano Takao: "A new family of 3/4 approximation algorithms and improved approximation algorithms for MAXSAT"情報処理学会アルゴリズム研究会報告. 70・7. 49-56 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 浅野孝夫: "離散構造とアルゴリズム(藤重悟編)"近代科学社. 204 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 浅野孝夫: "計算とアルゴリズム"オーム社. 295 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Asano, M.M.Halldorsson, K.Iwama and T.Matsuda: "Approximation algorithms for the maximum power consumption problem on combinatorial circuits."Proceedings of 11th International Symposium on Algorithms and Computation. LNCS1969, Springer. 204-215 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano: "Approximation algorithms based on semidefinite programming."Operations Research Society of Japan. 45(in Japanese). 520-527 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano and Y.Asano: "Recent developments in maximum flow algorithms."Journal of the Operations Research Society of Japan. 43. 2-31 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano, K.Iwama, H.Takada and Y.Yamashiata: "Designing high-quality approximation algorithms for combinatorial optimization problems."IEICE Transactions on Information and Systems. E83-D. 462-479 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano and D.P.Williamson: "Improved approximation algorithms for MAX SAT."Proceedings of 11th ACM-SIAM Symposium on Discrete Algorithms, San Francisco. 96-105 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Ono, T.Hirata and T.Asano: "Improvement of MAX SAT approximation algorithm with perturbation"Information and Communication Engineers. D-I, J81-D-I (in Japanese). 1107-1111 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano and D.P.Williamson: "A New Family of 3/4-Approximation Algorithms and Improved Approximation Algorithms for MAX SAT."Technical Reprot of Information Processing Society of Japan. SIGAL-TR-70-7. 49-56 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano: "Approximation algorithms with performance guarantees for analyzing logical systems."Information Processing of Japan. 39(in Japanese). 683-688 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano: "Graph-network optimization."Operations Research Society of Japan. 43 (in Japanese). 88-93 (1998)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano and H.Imai: "Computation and Algorithms."Ohm Company (in Japanese). 295 (2000)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2002-03-26  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi