載入...
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...
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Printed Book |
| 語言: | English |
| 出版: |
New York :
Cambridge University Press,
2011.
|
| 主題: | |
| 在線閱讀: | http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg |
因特網
http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpgDCS
| 索引號: |
004.421 WIL |
|---|---|
| 復印件 | Live Status Unavailable |