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...
Saved in:
| Online Access: | Electronic book from EBSCO |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: | Cambridge ; New York : Cambridge University Press, Ã2011. |
| Subjects: |