Table of Contents
Introduction
Elementary Data Structures
Divide-And-Conquer
The Greedy Method
Dynamic Programming
Basic Traversal and Search Techniques
Backtracking
Branch-And-Bound
Algebraic Simplification and Transformation
Lower Bound Theory
NP - Hard and NP-Complete Problems
Approximation Algorithms for NP-Hard Problems
Download
You can download this book from any of the following links. If any link is dead please feel free to leave a comment.
Download here
Copyright Disclaimer
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.
Links not working
ReplyDeleteUpdated
Delete