The Design of Approximation Algorithms
"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 = …
Read online
Reader not loading? Open it on Archive.org instead.
