Φορτώνει......
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.
|
| Θέματα: | |
| Διαθέσιμο Online: | http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg |
Διαδίκτυο
http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpgDCS
| Ταξιθετικός Αριθμός: |
004.421 WIL |
|---|---|
| Αντίγραφο | Η τρέχουσα κατάσταση είναι άγνωστη |