Combinatorial Algorithms
Select Format
Select Condition 
Book Overview
Updated second edition presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: how to mix known algorithms and create new ones. Features 153 black-and-white illustrations and 23 tables. Exercises, with answers at the ends of chapters.
Format:Hardcover
Language:English
ISBN:0201038595
ISBN13:9780201038590
Release Date:January 1982
Publisher:Addison Wesley Publishing Company
Length:292 Pages
Weight:1.35 lbs.
Customer Reviews
1 rating
A useful book on combinatorial algorithms
Published by Thriftbooks.com User , 16 years ago
I humbly disagree with the previous review. I think that this is a concise and useful book on combinatorial algorithms. It presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, matrix multiplication, and NP-complete problems. Moreover, answers to the exercises are provided. I think that the authors have done a good job in presenting and discussing the algorithms succinctly.
Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
