|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
Binding: Hardcover
EAN: 9780201038590
ISBN: 0201038595
Label: Addison Wesley Longman Publishing Co
Manufacturer: Addison Wesley Longman Publishing Co
Number Of Items: 1
Number Of Pages: 486
Publication Date: 1981-12
Publisher: Addison Wesley Longman Publishing Co
Studio: Addison Wesley Longman Publishing Co
Alternate Versions: Click to Display
Related Items:
Browse for similar items by category:
Editorial Review:
Product Description:
Newly enlarged, updated second edition of a valuable, widely used text 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. Includes two new chapters and two new appendices. The book assumes no background in linear programming or advanced data structure, and most of the material is suitable for undergraduates.
Average Rating: 
Rating:  -
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.
Rating:  -
It is not that the book is not full of information, it is. The material is just not presented well AT ALL. It is unbelievable how poor the writing is and it is packed full of disorganized pieces of information. If this book is good for anything, it is for listing a variety of topics in the table of contents so you can search on google to learn more if you are interested. Absolutely awful.
|
Amazon Store 