The Design of Approximation Algorithms

Williamson, David P.; Shmoys, David B.

ISBN 10: 0521195276 ISBN 13: 9780521195270
Editorial: Cambridge University Press, 2011
Usado Encuadernación de tapa dura

Librería: clickgoodwillbooks, Indianapolis, IN, Estados Unidos de America Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Vendedor de AbeBooks desde 5 de julio de 2024

Este artículo en concreto ya no está disponible.

Descripción

Descripción:

Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media. N° de ref. del artículo CSIV.0521195276.A

Denunciar este artículo

Sinopsis:

Designed as a textbook for graduate courses on algorithms, this book will also serve as a reference for researchers interested in heuristic solutions of discrete optimization problems. It presents central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.

Acerca de los autores: David P. Williamson is a Professor at Cornell University with a joint appointment in the School of Operations Research and Information Engineering and in the Department of Information Science. Prior to joining Cornell, he was a Research Staff Member at the IBM T. J. Watson Research Center and a Senior Manager at the IBM Almaden Research Center. He has won several awards for his work on approximation algorithms, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. He has served on several editorial boards, including ACM Transactions on Algorithms, Mathematics of Operations Research, the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics.

David Shmoys has faculty appointments in both the School of Operations Research and Information Engineering and the Department of Computer Science, and he is currently Associate Director of the Institute for Computational Sustainability at Cornell University. He is a Fellow of the ACM, was an NSF Presidential Young Investigator, and has served on numerous editorial boards, including Mathematics of Operations Research (for which he is currently an associate editor), Operations Research, the ORSA Journal on Computing, Mathematical Programming and both the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics; he also served as editor-in-chief for the latter.

"Sobre este título" puede pertenecer a otra edición de este libro.

Detalles bibliográficos

Título: The Design of Approximation Algorithms
Editorial: Cambridge University Press
Año de publicación: 2011
Encuadernación: Encuadernación de tapa dura
Condición: acceptable

Los mejores resultados en AbeBooks

Existen otras 12 copia(s) de este libro

Ver todos los resultados de su búsqueda