Approximation Algorithms for Np-Hard Problems
- Binding: Hardcover
- Edition: 01
- Publisher: Cengage
- Publish date: 07/01/1996
Description:
This book provides computer scientists and operations researchers with as effective framework for analyzing approximation algorithms and applying them to the solution of intractable problems. Each chapter examines a specific application area including scheduling, network design, connectivity problems, low-degree structures, Euclidian problems, on-line problems, covering and packing problems, counting problems, multicommodity problems, and bin packing problems and explores unifying problem-solving techniques.
Expand description
Product notice
Returnable at the third party seller's discretion and may come without consumable supplements like access codes, CD's, or workbooks.
| Seller | Condition | Comments | Price |
|
HPB-Red
|
Good
|
$36.58
|
|
ErgodeBooks
|
Good |
$76.85
|
|
Bonita
|
Good
|
$78.43
|
|
Bonita
|
New
|
$104.17
|
|
Just one more Chapter
|
New |
$122.57
|
|
ErgodeBooks
|
New |
$258.06
|
Please Wait