This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. “Mathematicians wishing a self-contained introduction need look no further.”—American Mathematical Monthly. 1982 ed.
Design and modeling for computer experiments eBook
$15.00
Design and Analysis of Data Structures eBook
$15.00
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing) eBook
$12.00
- Delivery: Can be download immediately after purchasing. For new customer, we need process for verification from 30 mins to 24 hours.
- Version: PDF/EPUB. If you need another version, please Contact us
- Quality: Full page, full content, high quality images, searchable text and you can print it.
- Compatible Devices: Can be read on any devices (Kindle, NOOK, Android/IOS devices, Windows, MAC,..).
- e-Book Features: Purchase and read your book immediately, access your eTextbook anytime and anywhere, unlimited download and share with friends.
- Note: If you do not receive the download link within 15 minutes of your purchase, please Contact us. Thank you!
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing) eBook
$12.00
Reviews
There are no reviews yet.