Approximation Algorithms N P Hard by Hochbaum Dorit (1 results)

- Hardcover
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.World of Books (was SecondSale)
Contact seller5-star sellerCondition: Used - Good
£ 24.45
Free ShippingShips within U.S.A.Quantity: 2 available
Hardback. Condition: Good. 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.