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

Discrete Algorithms Based on a Unified Method Combining Data Structures and Mathematical Programming

Research Project

Project/Area Number 04650324
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 情報工学
Research InstitutionCHUO UNIVERSITY

Principal Investigator

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

Project Period (FY) 1992 – 1994
Project Status Completed (Fiscal Year 1994)
Budget Amount *help
¥2,200,000 (Direct Cost: ¥2,200,000)
Fiscal Year 1994: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 1993: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 1992: ¥1,000,000 (Direct Cost: ¥1,000,000)
KeywordsData structures / Mathematical Programming / Discrete algorithms / Computational geometry / Network theory
Research Abstract

Researches on discrete algorithms have been done vigorously not only from the practical point of view but also from the theoretical point of view. Recently, the significance of the parallelization of discrete algorithms has been realized and parallel algorithms have also been extensively studied. There have been two basic approaches to designing efficient discrete algorithms : efficient data structures and mathematical programming methods. However, researches on these two fields have been done independently. This prevented us from developing efficient algorithms sometimes. It has been realized that, in order to overcome this difficulty, we should have an approach which unifies these two methods.
In view of the above situation, the purpose of this research is to search a useful method which unites data structures and mathematical programming and, based on the method, to develop efficient discrete algorithms. To achieve, we first made an investigation on similar techniques developped befo … More re in network algorithms for the maximum flow problem, the minimum-cost flow problem and the maximum weight matching problem. Through this investigation, I could find some idea to developping a method which unites data structures and mathematical programming to devise efficient algorithms and proposed new algorithms based on this method. To evaluate the new algorithms not only from the theoretical point of view but also from the practical point of view, I implemented the algorithms as well as the algorithms previously proposed by other researches and made computational experiments.
The results in this research were published in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences and in International Journal of Computational Geometry and Applications. Some other papers are now submitted to Journal of Computer and System Sciences and Journal of Combinatorial Theory (B). In view of this, the purpose of this research can be said to be satisfatorily achieved. Less

Report

(4 results)
  • 1994 Annual Research Report   Final Research Report Summary
  • 1993 Annual Research Report
  • 1992 Annual Research Report
  • Research Products

    (28 results)

All Other

All Publications (28 results)

  • [Publications] Takao Asano: "Dynamic Programming on Intervals" International Journal of Computational Geomentry and Appliations. 3. 323-330 (1993)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] Takao Asano: "Graphical Degree Sequence Problen with Connectivity Requirements" Proceedings of the 4th International Syvposium on Algorithms and Computation(Lecture Notes in Computer Science). 762. 32-40 (1993)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] Masaya Takahashi: "Graphical Degree Sequence Problems" IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. E77-A. 546-552 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] Satoshi Kagami: "Practical Efficiencies of Planar Point Location Algorithms" IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences. E77-A. 608-614 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] Takao Asano: "An O(nlog logn)Time Algorithm for Constructing a Graph of Matimum Connectivity with Prescribed Degrees" 情報処理学会(アルゴリズム研究会報告). 93-AL-36. 33-40 (1993)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] Takao Asano: "Constructing a Bipartite Graph of Maximum Connectivity with Prescribed Degrees" 電子情報通信学会(回路とシステム研究会報告). CAS94-64. 63-70 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] 佐々木建昭: "計算代数と計算幾何(岩波講座応用数学)" 岩波書店, 166 (1993)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] 浅野孝夫: "情報の構造" 日本評論社, 396 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] T.Asano: "Dynamic Programming on Intervals." International Journal of Computational Geometry and Applications. Vol.3. 323-330 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] T.Asano: "Graphical Degree Sequence Problem with Connectivity Requirements." Proceedings of the 4th International symposium on Algorithms and Computation (Lecture Notes in Computer Science 762, Springer). 32-40 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] M.Takahashi, K.Imai and T.Asano: "Graphical Degree Sequence Problems." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. Vol.E77-A. 546-552 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] S.Kagami, M.Edahiro and T.Asano: "Practical Efficiencies of Planar Point Location Algorithms." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. Vol.E77-A. 608-614 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] T.Sasaki, H.Imai, T.Asano and K.Sugihara: Computational Algebra and Computational Geometry.Iwanami-Shoten, 166 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] T.Asano: The Structure of Information : Data Structures and Algorithms on Graphs and Networks.Nihon-Hyouron-Sha, 396 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1994 Final Research Report Summary
  • [Publications] Kagami Satoshi: "Practical Efficiencies of Planar Point Location Algorithms" 電子情報通信学会 Transactions on Fundamentals. 77-A. 608-614 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] Asano Takao: "Constructing a Bipartite Graph of Maximum Connectivity with Prescribed Degrees" 電子情報通信学会回路とシステム研究会. CAS94-64. 63-70 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 小野孝男: "Max 3-SATに対する高性能近似アルゴリズム" 情報処理学会アルゴリズム研究会. 35(発表予定). (1995)

    • Related Report
      1994 Annual Research Report
  • [Publications] Asano Takao: "Dynamic Programming on Intervals" International Journal of Computational Geometry & Applications. 3. 323-330 (1993)

    • Related Report
      1993 Annual Research Report
  • [Publications] Asano Takao: "Graphical Degree Seguence Problem with Connectiity Reguirements" Proc 4th International Symposium of Algorithus and Computation. Lecture Note in Computer Science 762. 38-47 (1993)

    • Related Report
      1993 Annual Research Report
  • [Publications] Asano Takao: "An O(n loglog n)time Algorithm for Constructing a Grogh of Maximum Connectivity with Prescribed Pegrees" 情報処理学会アルゴリズム研究会. 36. 33-40 (1993)

    • Related Report
      1993 Annual Research Report
  • [Publications] Takahashi Masaya: "Graphical Degree Seguence Problems" 電子情報通信学会Transactions on Fundementals. 77-A,(印刷中). (1994)

    • Related Report
      1993 Annual Research Report
  • [Publications] Kagami Satoshi: "Practical Efficiencies of Planar Point Location Algovithns" 電子情報通信学会Transactions on Fundamentals. 77-A,(印刷中). (1994)

    • Related Report
      1993 Annual Research Report
  • [Publications] 浅野 孝夫(共著): "計算代数・計算幾何" 岩波書店, 166 (1993)

    • Related Report
      1993 Annual Research Report
  • [Publications] 浅野 孝夫(単著): "情報の構造" 日本評論社, 396 (1994)

    • Related Report
      1993 Annual Research Report
  • [Publications] KAGAMI Satoshi: "Practical Efficiencies of Planar Point Location Algorithms" 情報処理学会アルゴリズム研究会. 27. 39-46 (1992)

    • Related Report
      1992 Annual Research Report
  • [Publications] TAKAHASHI Masaya: "Graphical Degree Sequence Problems" 情報処理学会アルゴリズム研究会. 33. (1993)

    • Related Report
      1992 Annual Research Report
  • [Publications] 浅野 孝夫(共著): "計算幾何" 岩波書店, 94 (1993)

    • Related Report
      1992 Annual Research Report
  • [Publications] 浅野 孝夫(単著): "情報の構造" 日本評論社, 352 (1993)

    • Related Report
      1992 Annual Research Report

URL: 

Published: 1992-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi