The design of approximation algorithms / David P. Williamson, David B. Shmoys.

Show other versions (1)

"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 =...

Full description

Saved in:
Bibliographic Details
Main Author: Williamson, David P.
Other Authors: Shmoys, David Bernard
Language:English
Published: New York : Cambridge University Press, 2011.
Subjects:
Approximation theory.
Mathematical optimization.
COMPUTERS / Programming / Algorithms.
Physical Description:xi, 504 pages : illustrations ; 26 cm
Format: Book

MSU Remote Storage

Holdings details from MSU Remote Storage
Call Number: QA221 .W55 2011
QA221 .W55 2011 Available Get this