The Design of Approximation Algorithms

Usually delivers within 2 weeks.

Description

Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. 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 section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.

Product Details

Price
£52.99
Publisher
Cambridge University Press
Publish Date
Language
English
Type
Hardback
EAN/UPC
9780521195270
BIC Categories:

Earn By Promoting Books

Earn money by sharing your favourite books through our Affiliate programme.

Become an Affiliate
We use cookies and similar methods to recognize visitors and remember their preferences. We also use them to help detect unauthorized access or activity that violate our terms of service, as well as to analyze site traffic and performance for our own site improvement efforts. To learn more about these methods, including how to disable them view our Cookie Policy.