Denna webbshop är stängd för köp.
Klicka här för mer information

The Design of Approximation Algorithms
  • Bandtyp: Inbunden
  • Språk: Engelska
  • Utgiven: 201104
  • Antal sidor: 518
  • Vikt i gram: 1120
  • ISBN10:0521195276
  • ISBN13:9780521195270

The Design of Approximation Algorithms


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.

Kundrecensioner och bloggar

Sök fler böcker:

Kunder som köpt denna bok har
även köpt:
Information, Physics, and Computation
Introduction to Derivative-free Optimiza
Network Information Theory
Network Information Theory
av El Gamal, Abbas
Large Deviations Techniques and Applicat
Skotten i Köpenhamn :  ett reportage om