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.

Author: Hu

VAT: No

Minimum Order Quantity: 0

Delivery:  Usually ships in 28 days. Import title.    

All UK orders are POST FREE!

All prices shown include applicable taxes.