科图分类法:	O174.41 版次：
中图分类法:	O174.41 版次：
著者:	Williamson, David P.
题名:	The design of approximation algorithms / / ,
出版发行:	出版地： New York : 出版社： Cambridge University Press, 出版日期： 2011.
载体形态:	xi, 504 p. : ill. ; 26 cm.
内容提要:	"Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems"--
主题词:	Approximation theory.
主题词:	Mathematical optimization.
主要责任者:	Shmoys, David Bernard.