טוען...
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 |
|---|---|
| עותק | סטטוס עדכני לא זמין |