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|