The Design of Approximation Algorithms

The Design of Approximation Algorithms
Author :
Publisher : Cambridge University Press
Total Pages : 518
Release :
ISBN-10 : 0521195276
ISBN-13 : 9780521195270
Rating : 4/5 (270 Downloads)

Book Synopsis The Design of Approximation Algorithms by : David P. Williamson

Download or read book The Design of Approximation Algorithms written by David P. Williamson and published by Cambridge University Press. This book was released on 2011-04-26 with total page 518 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


The Design of Approximation Algorithms Related Books

The Design of Approximation Algorithms
Language: en
Pages: 518
Authors: David P. Williamson
Categories: Computers
Type: BOOK - Published: 2011-04-26 - Publisher: Cambridge University Press

GET EBOOK

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design
Approximation Algorithms
Language: en
Pages: 380
Authors: Vijay V. Vazirani
Categories: Computers
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media

GET EBOOK

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,
Geometric Approximation Algorithms
Language: en
Pages: 378
Authors: Sariel Har-Peled
Categories: Computers
Type: BOOK - Published: 2011 - Publisher: American Mathematical Soc.

GET EBOOK

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric appro
Approximation Algorithms and Semidefinite Programming
Language: en
Pages: 253
Authors: Bernd Gärtner
Categories: Mathematics
Type: BOOK - Published: 2012-01-10 - Publisher: Springer Science & Business Media

GET EBOOK

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice
Design and Analysis of Approximation Algorithms
Language: en
Pages: 450
Authors: Ding-Zhu Du
Categories: Mathematics
Type: BOOK - Published: 2011-11-18 - Publisher: Springer Science & Business Media

GET EBOOK

This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for research