The Design of Approximation Algorithms

Released on by David P. Williamson
preview-18

  • The Design of Approximation Algorithms Book Detail

  • Author : David P. Williamson
  • Release Date : 2011-04-26
  • Publisher : Cambridge University Press
  • Genre : Computers
  • Pages : 518
  • ISBN 13 : 9780521195270
  • File Size : 1,1 MB
DOWNLOAD BOOK

The Design of Approximation Algorithms by David P. Williamson PDF Summary

Book Description: 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.

Disclaimer: www.yourbookbest.com does not own The Design of Approximation Algorithms books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.

The Design of Approximation Algorithms

The Design of Approximation Algorithms

File Size : 57,57 MB
Total View : 9820 Views
DOWNLOAD

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design

Approximation Algorithms

Approximation Algorithms

File Size : 83,83 MB
Total View : 514 Views
DOWNLOAD

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

Geometric Approximation Algorithms

File Size : 34,34 MB
Total View : 771 Views
DOWNLOAD

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