4.11 - 1251 ratings - Source

Provides in-depth coverage of traditional and current topics in sequential algorithms, and also gives a solid introduction to the theory of parallel and distributed algorithms reflecting the emergence of modern computing environments such as parallel computers, the Internet, cluster and grid computing.Shmoys, D. B. aquot;Computing Near-Optimal Solutions to Combinatorial Optimization Problems.aquot; In Combinatorial Optimization ... Sipser, M. Introduction to the Theory of Computation. Boston: PWS, 1997. Skiena, S. S. Algorithm Design Manual.

Author: Kenneth A. Berman, Jerome L. Paul
Publisher:Course Technology Ptr - 2005

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.

Click button below to register and download Ebook
Privacy Policy | Contact | DMCA