Approximation Algorithms for n-p Hard Problems
Summary
The feel-good place to buy books
Approximation Algorithms for n-p Hard Problems by Dorit Hochbaum
Discussing approximation algorithms for n-p hard problems, this study details scheduling, connectivity problems, randomization in approximations, best possible results, and on-line and server problems.| SKU | Unavailable |
| ISBN 13 | 9780534949686 |
| ISBN 10 | 0534949681 |
| Title | Approximation Algorithms for n-p Hard Problems |
| Author | Dorit Hochbaum |
| Condition | Unavailable |
| Publisher | Cengage Learning, Inc |
| Year published | 1996-07-26 |
| Number of pages | 464 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |