There's still time! Order before midnight on Tuesday 18th for Christmas Delivery

The design of approximation algorithms

by David P. Williamson | 26 April 2011
Hardback
Synopsis
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.
€72.79
218 Reward Points
Currently out of stock
Delivery in 5-7 Days
Eligible for free delivery

Any purchases for more than €10 are eligible for free delivery anywhere in the UK or Ireland!

Synopsis
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.
€72.79
218 Reward Points
Currently out of stock
Delivery in 5-7 Days
Eligible for free delivery

Any purchases for more than €10 are eligible for free delivery anywhere in the UK or Ireland!


Product Details

ISBN - 9780521195270
Format - Hardback
Publisher -
Published - 26/04/2011
Categories - All, Books, Science and Nature, Science, Mathematics, All, Books, Business Computers, Computers, Computer Programming
No. of Pages - 518
Weight - 1120
Edition -
Series - - Not Available
Page Size - 26
Language - en-US
Readership Age - Not Available
Table of Contents - Not Available

Delivery And Returns

Please Note: Items in our extended range may take longer to deliver. Delivery in 5-7 Days

Place an order for over €10 to receive free delivery to anywhere in Ireland and the UK! See our Delivery Charges section below for a full breakdown of shipping costs for all destinations.

 

Delivery Charges

  Ireland & UK* Europe & USA Australia & Canada Rest of World
Under €10 €3.80 €10 €15 €25
Over €10
Free €10 €15 €25

*Free delivery on all orders over €10 - only applies to order total.

All orders will be delivered by An Post.