ID: 4760
The Design of Approximation Algorithms 9780521195270
€53,40
Geen aanbiedingen geplaatst
Omschrijving
ISBN: 9780521195270
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
Dit artikel bestel je voordelig 2e hands op studystore.nlIn goede staat, snel in huis én gratis thuisbezorgd. Toelichting:De prijs in deze advertentie is gebaseerd op onze laagste 2e hands prijs (OP=OP).Zodra een 2e hands boek op is, kan het voorkomen dat je op Studystore het boek alleen nog nieuw kunt bestellen.
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
Dit artikel bestel je voordelig 2e hands op studystore.nlIn goede staat, snel in huis én gratis thuisbezorgd. Toelichting:De prijs in deze advertentie is gebaseerd op onze laagste 2e hands prijs (OP=OP).Zodra een 2e hands boek op is, kan het voorkomen dat je op Studystore het boek alleen nog nieuw kunt bestellen.