Name: The Design of Approximation Algorithms (en Inglés)
Price: 102.54 USD
Availability: InStock
Author: Williamson, David P. ; Shmoys, David B.
ISBN: 9780521195270

portada The Design of Approximation Algorithms (en Inglés)

The Design of Approximation Algorithms (en Inglés)

Formato

Libro Físico

Autor

David P. Williamson

David B. Shmoys

Editorial

Cambridge University Press

Año

2011

Idioma

Inglés

N° páginas

504

Encuadernación

Tapa Dura

Dimensiones

26.2 x 18.9 x 3.4 cm

Peso

1.12 kg.

ISBN13

9780521195270

N° edición

Categorías

Algoritmos y estructuras de datos

The Design of Approximation Algorithms (en Inglés)

David P. Williamson (Autor) · David B. Shmoys (Autor) · Cambridge University Press · Tapa Dura

Libro Nuevo Importado

Envío: 15 a 21 días háb.

$ 205.09$ 102.54

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 10 unidades

$ 102.54

Llega entre el 02 Sep y el 14 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "The Design of Approximation Algorithms (en Inglés)"

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.