论文信息 - Complexity of exact and approximate solution of problems: an introduction

Complexity of exact and approximate solution of problems: an introduction

NP-complete optimization problems are frequently encountered in the optimal design of computer systems,operating systems, databases etc. In this paper a discussion of the basic techniques which lead to the characterization of the complexity of optimization problems is presented. The class of optimization problems which are associated to NP-complete decision problems is then presented and various algorithmic techniques for the approximate solution of such problems are introduced. Finally necessary and sufficient conditions for the approximability of optimization problems are given.

Giorgio Ausiello | G. Ausiello

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .

[4] Michael Randolph Garey,et al. Johnson: "computers and intractability , 1979 .

[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[6] Giorgio Ausiello,et al. Full Approximatibility of a Class of Problems over Power Sets , 1981, CAAP.

[7] Giorgio Ausiello,et al. Toward a Unified Approach for the Classification of NP-Complete Optimization Problems , 1979, Theor. Comput. Sci..