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

Algorithm Engineering as a New Paradigm : A Challenge to Hard Computation Problems

Research Project

Project/Area Number 10205101
Research Category

Grant-in-Aid for Scientific Research on Priority Areas (B)

Allocation TypeSingle-year Grants
Research InstitutionKyoto University

Principal Investigator

IBARAKI Toshihide  Kyoto University, Graduate School of Informatics, Professor, 情報学研究科, 教授 (50026192)

Co-Investigator(Kenkyū-buntansha) FUJISHIGE Satoru  Osaka University, Graduate School of Engineering science, Professor, 基礎工学研究科, 教授 (10092321)
YAMASHITA Masafumi  Kyushu University, Deptment of Computer Science and Communication Engineering, Professor, システム情報科学研究科, 教授 (00135419)
SUGIHARA Kokichi  University of Tokyo, Graduate School of Engineering, Professor, 情報理工学系研究科, 教授 (40144117)
ASANO Takao  Chuo University, Professor, 理工学部, 教授 (90124544)
IGARASHI Yoshihide  Gunma University, Faculty of Engineering, Professor, 工学部, 教授 (60006260)
Project Period (FY) 1998 – 2001
Project Status Completed (Fiscal Year 2001)
Budget Amount *help
¥49,900,000 (Direct Cost: ¥49,900,000)
Fiscal Year 2001: ¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 2000: ¥18,200,000 (Direct Cost: ¥18,200,000)
Fiscal Year 1999: ¥16,700,000 (Direct Cost: ¥16,700,000)
Fiscal Year 1998: ¥13,500,000 (Direct Cost: ¥13,500,000)
Keywordsalgorithm engineering / computational complexity / algorithm / combinatorial problem / graph, network / computational geometry / parallel / distributed computation
Research Abstract

The objective of this research project is to establish a new paradigm, "Algorithm Engineering", which offers high performance and flexible algorithms that can solve a wide variety of large-scale optimization problems in the practical sense, as well as the technology and methodology of algorithm development from the viewpoint of engineering.
Our project consists of the following four research areas : (A01) discrete optimization algorithm, (A02) graph algorithm, (A03) geometric algorithm, and (A04) parallel/distributed algorithm. This research group is for integrating these four research areas and conducting activities on the entire project. Some of our main activities are as follows :
1. Conference and Symposium
We held conferences twice a year (in spring and fall). As for the conference in October 2000, we held it as an international symposium, and invited 12 foreign researchers. In addition, we held an open symposium in October 2001.
2. Publication
In order to propagate the concept of "Algorithm Engineering" and introduce our research project, we published numbers of papers and books. Among these publications, a book entitled : "Algorithm Engineering --- A Challenge to Hard Computation Problems" was written by our 63 project members, and includes foundations of algorithm engineering, frameworks, the state-of-the-art and case studies.
3. Algorithm Database
We constructed Algorithm Database, which contains algorithms and software developed in our research project, and these are available via Internet. Currently more then 60 algorithms and demos are registered.

Report

(5 results)
  • 2001 Annual Research Report   Final Research Report Summary
  • 2000 Annual Research Report
  • 1999 Annual Research Report
  • 1998 Annual Research Report
  • Research Products

    (37 results)

All Other

All Publications (37 results)

  • [Publications] K.Sugihara, M.Iri, H.Inagaki, T.Imai: "Topology-oriented implementation---An approach to robust geometric algorithms"Algorithmica. 27. 5-20 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] T.Nakata, H.Imahayashi, M.Yamashita: "A Probabilistic Local Majority Polling Game on Weighted Directed Graphs with an Application to the Distributed Agreement Problem"Networks. 35・4. 226-273 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Fujishige, S.: "Notes on L-/M-convex functions and the separation theorems"Mathematical Programming. 88. 129-146 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] T.Asano, D.P.Williamson: "Improved approximation algorithms for MAX SAT"Journal of Algorithms. 42・1. 173-202 (2002)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] H.Nagamochi, T.Ibaraki: "Polyhedral structure of submodular and posimodular systems"Discrete Applied Mathematics. 107. 165-189 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Yoshikawa, R.: "Secret key exchange using random deals of cards on hierarchical structures"Lecture Notes in Computer Science. 1969. 290-301 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 杉原厚吉, 茨木俊秀, 浅野孝夫, 山下雅史(編): "アルゴリズム工学---計算困難問題への挑戦"共立出版. 280 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] K. Sugihara, M. Iri, H. Inagaki and T. Imai: "Topology-oriented implementation---An approach to robust geometric algorithms"Algorithmica. 27. 5-20 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] T. Nakata, H. Imahayashi, and M. Yamashita: "A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem"Networks. 35・4. 226-273 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] S. Fujishige: "Notes on L-/M-convex functions and the separation theorems"Mathematical Programming. 88. 129-146 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] T. Asano and D. P. Williamson: "Improved approximation algorithms for MAX SAT"Journal of Algorithms. 42・1. 173-202 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] H. Nagamochi, T. Ibaraki: "Polyhedral structure of submodular and posimodular systems"Discrete Applied Mathematics. 107. 165-189 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] R. Yoshikawa: "Secret key exchange using random deals of cards on hierarchical structures"Lecture Notes in Computer Science. 1969. 290-301 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] K. Sugihara, T. Ibaraki, T. Asano, M. Yamashita (eds.): "Algorithm Engineering --- A Challenge to Hard Computation Problems (in Japanese)"Kyoritsu Syuppan. 280 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] S.Fujishige, S.Patkar: "Realization of set functions as cut functions of graphs and hypergraphs"Discrete Mathematics. 226. 199-210 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] M.Yagiura, T.Ibaraki: "Efficient 2 and 3-flips neighborhood search algorithm for the MAX-SAT : Experimental evaluation"Journal of Heuristics. (To appar).

    • Related Report
      2001 Annual Research Report
  • [Publications] K.Murota, A.Tamura: "New characterizations of M-convex functions and their applications to economic equilibrium models"Discrete Applied Mathematics. (To appar).

    • Related Report
      2001 Annual Research Report
  • [Publications] R.Yoshikawa, S.Guo, Y.Igarashi, K.Motegi: "Construction of secret key exchange spanning trees by random deals on hierarchical structures"IEICE Tran. Fundamentals. E84-A・5. 1110-1119 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] M.Yamashita, H.Umemoto, I.Suzuki, T.Kameda: "Searching for a mobile intruder in a polygonal region by a group of mobile searchers"Algorithmica. (To appar).

    • Related Report
      2001 Annual Research Report
  • [Publications] K.Iwama, Y.Kambayashi, S.Miyazaki, Y.Morita: "New bounds for oblivious mesh routing"Journal of Graph Algorithms and Applications. (To appar).

    • Related Report
      2001 Annual Research Report
  • [Publications] 杉原厚吉, 茨木俊秀, 浅野孝夫, 山下雅史(編): "アルゴリズム工学"共立出版. 280 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] K.Sugihara: "Three-Dimensional convex hull as a fruitful source of diagrams"Theoretical Computer Science. 235・2. 325-337 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] S.Fujishige,K.Murota : "Notes on L-/M-convex functions and the separation theorems"Mathematical Programming. A-88. 129-146 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] S.Fogita,M.Yamashita,T.Kameda: "A Study on r-Configuration-a Resource Assignment Problem on Graphs."SIAM J.Discrete Mathematics. 13・2. 227-254 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Sakai,H.,Nakamura ,N.,Igarashi,Y.: "A refined definition of semantic security for pabli-key encryption schemes"IEICE Transactions on Information and Systems. E84D・1. 34-39 (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] H.Nagamochi,T.Ibaraki: "Polyhedral structure of submodular and posimodular systems"Discrete Applied Mathematics. (to appear).

    • Related Report
      2000 Annual Research Report
  • [Publications] T.Asano,Y,Asano: "Recent developments in maximum flow algorithms"Journal of the Operations Research Society of Japan. 43(to appear). (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 杉原厚吉,茨木俊秀,浅野孝夫,山下雅史(編): "アルゴリズム工学"共立出版(発行予定). (2001)

    • Related Report
      2000 Annual Research Report
  • [Publications] K. Sugihara: "Surface interpolation based on new local coordinates"Conputer-Aiaed Design. 31. 51-58 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] M. Yamashita, T. Kameda: "Leader election problem on networks in which processor identity numbers are not distinct"IEEE Trans. Parallel and Distributed Systems. 10・9. 878-887 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] S. Fujishige, S. Iwata: "Minimizing a submodular function arizing from a concave function"Discrete Applied Mathematics. 92. 211-215 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Y. Han, Y. Igarashi: "Parallel PROFIT/COST algorithms through faskderadomization"Acta Informatica. 36. 215-232 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] T. Ibaraki: "Partially defined Boolean functions with applications to data analysis"Mathematica Japonica. 51・1. 153-165 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] 浅野孝夫、今井浩: "計算とアルゴリズム"オーム社. 295 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] 茨木俊秀: "Cによるアルゴリズムとデータ構造"昭晃堂. 226 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] K.Nonobe and T.Ibaraki: "A tabu search approach for the constraint satisfaction problem as a general problem solver" European J.Operational Research. 106. 599-623 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] H.Nagamochi and T.Ibaraki: "Augmenting edge-connectivity over the entire range in O(nm) time" J.Algorithms. 30. 253-301 (1999)

    • Related Report
      1998 Annual Research Report

URL: 

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

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi