Contact
Cum să cumpăr
Livrare
Consilier de cumpărături
Design of Approximation Algorithms
engleză
217 b
Până la 30 de zile pentru returnare
Clienții au cumpărat de asemenea
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.
Informații despre carte
engleză
Dăruiește această carte chiar astăzi
Este foarte ușor
1 Adaugă cartea în coș și selectează Livrează ca un cadou 2 Îți vom trimite un voucher în schimb 3 Cartea va ajunge direct la adresa destinataruluiAr putea de asemenea, să te intereseze
/
Carte broșată
81.11
lei
/
Carte broșată
624.05
lei
/
Carte broșată
67.30
lei
Bună ziua! Sunt Libroamiko, consilierul dumneavoastră de cărți.
Cu ce vă pot ajuta?