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 = N...
| Glavni autor: | |
|---|---|
| Daljnji autori: | |
| Format: | Knjiga |
| Jezik: | engleski |
| Izdano: |
New York
Cambridge University Press
2011.
|
| Teme: |