SKU/Artículo: AMZ-0521195276

The Design of Approximation Algorithms

Format:

Hardcover

Hardcover

Kindle

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
1.24 kg
Devolución:
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. 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 part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
AR$245.177
49% OFF
AR$125.735

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

AR$245.177
49% OFF
AR$125.735

Pagá fácil y rápido con Mercado Pago o MODO

Llega en 12 a 18 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja de USA a tus manos en