Contact
Hoe winkelen bij ons werkt
Bezorging
Winkelgids
Design of Approximation Algorithms
Engels
208 b
Retourneren binnen 30 dagen
Klanten kochten ook
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.
Informatie over het boek
Engels
Geef dit boek vandaag nog cadeau
Dat gaat heel eenvoudig
1 Voeg het boek toe aan je winkelwagentje en selecteer Als cadeau bezorgen 2 Je krijgt van ons per omgaand een voucher 3 Het boek wordt bezorgd op het adres van de ontvangerDit vind je misschien ook interessant
/
Gebonden (paperback)
15.26
€
/
Gebonden (paperback)
7.07
€
/
Gebonden (paperback)
114.60
€
/
Gebonden (paperback)
12.13
€
Hoi! Ik ben Libroamiko, je boekadviseur.
Hoe kan ik je helpen?