English Books > Mathematics > General > Approximation Algorithms For NP-Hard Problems

Approximation Algorithms For NP-Hard Problems
Author: Hochbaum, Dorit S.
Hardback; Book
464 pages
Published: December 1996
Thomson Learning
ISBN: 0534949681

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.



SurfStoreUSA

Google
 
The NetStoreUSA website is operated by Open Communications, Inc
an Arizona corporation, which has successfully served
the Internet community since 1994.



Copyright © 2008 Open Communications, Inc
®Open Communications is a Registered Trade Mark.
This material may be freely distributed ONLY with full reference to Open Communications Inc,
including fax, phone, e-mail, and world-wide web details.
This material is an invitation to treat and not an offer.
We reserve the right to decline orders received from this site.
Prices subject to change to be advised on confirmation of order.
Not all titles listed are in print.
Home Page: http://www.NetStoreUSA.com/
Site Map