國立虎尾科技大學 |

登入

回首頁

The design of approximation algorithms /

Shmoys, David Bernard.

The design of approximation algorithms /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The design of approximation algorithms // David P. Williamson, David B. Shmoys.
作者:	Williamson, David P.
其他作者:	Shmoys, David Bernard.
出版者:	New York :Cambridge University Press, : 2011.,
面頁冊數:	xi, 504 p. :ill. ; : 26 cm.;
標題:	Approximation theory. -
電子資源:	http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg
ISBN:	0521195276 (cloth) :

The design of approximation algorithms /
Williamson, David P.

The design of approximation algorithms /David P. Williamson, David B. Shmoys. - New York :Cambridge University Press,2011. - xi, 504 p. :ill. ;26 cm.

Includes bibliographical references and indexes.

"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"--

ISBN: 0521195276 (cloth) :NT1659

LCCN: 2011001945Subjects--Topical Terms:

527707
Approximation theory.

LC Class. No.: QA221 / .W55 2011

Dewey Class. No.: 518/.5

The design of approximation algorithms /
LDR:02064cam a22002414a 450 001 708781
005 20110715093311.0
008 120821s2011 nyua b 001 0 eng
010 $a 2011001945
020 $a 0521195276 (cloth) : $c NT1659
020 $a 9780521195270 (cloth)
035 $a (OCoLC)ocn671709856
035 $a 16611561
040 $a DLC $c DLC $d YDX $d BTCTA $d YDXCP $d CDX $d GIKBM $d DLC $d NFU
041 0 $a eng
042 $a pcc
050 0 0 $a QA221 $b .W55 2011
082 0 0 $a 518/.5 $2 22
100 1 $a Williamson, David P. $3 837080
245 1 4 $a The design of approximation algorithms / $c David P. Williamson, David B. Shmoys.
260 $a New York : $c 2011. $b Cambridge University Press,
300 $a xi, 504 p. : $b ill. ; $c 26 cm.
504 $a Includes bibliographical references and indexes.
520 $a "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"-- $c Provided by publisher.
650 0 $a Approximation theory. $3 527707
650 0 $a Mathematical optimization. $3 527675
700 1 $a Shmoys, David Bernard. $3 837081
856 4 2 $3 Cover image $u http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg