Data Structures and Combinatorial Algorithms

这个项目的目的是发现和理解高效的数据结构和组合算法，以及可以用来发现和分析它们的工具和技术。其目标有四个：o设计特定的算法和数据结构，以适应各种重要的组合问题的需要，从而为这些问题产生更有效的解决方法；O利用这些新方法及其较老的竞争者开发实施和进行实证研究，目的是了解它们的基本特性并开发改进的变种；O对所审议方法的最坏情况和平均情况进行理论研究，目的是能够预测在特定情况下哪种方法最合适；O开发设计和分析的一般主题，并在构建新的算法和数据结构时系统地应用这些主题。

Abstract The purpose of this project is to discover and to understand efficient data structures and combinatorial algorithms and the tools and techniques by which they can be discovered and analyzed. The goals are four-fold: o to devise specific algorithms and data structures tailored to the needs of various importatnt combinatorial problems, thereby producing more efficient solution methods for these problems; o to develop implementations and perform empirical studies with these new methods and their older competitors, with the aim of understanding their essential properties and developing improved variations; o to perform theoretical studies of the worst- and average-case performance of the methods under consideration, with the aim of being able to predict which method is most suitable in a given situation; o to develop general themes of design and analysis, and to apply these themes systematically in the construction of new algorithms and data structures.