Horowitz Ellis  <br/><br/>
Fundamentals of Computer Algorithms 
Ellis Horowitz 
 - 2 nd Ed. 
 - Chennai  Universities Press  2008 
 - xx,773p.  23cm 
<br/><br/> 1 INTRODUCTION  2 ELEMENTARY DATA STRUCTURES  3. DIVIDE AND CONQUER  4 THE GREEDY METHOD  5 DYNAMIC PROGRAMMING  6 BASIC TRAVERSAL AND SEARCH TECHNIQUES  7 BACKTRACKING  8 BRANCH AND BOUND  9 ALGEBRAIC PROBLEMS  10 LOWER BOUND THEORY   	 <br/>11 NP-HARD AND NP-COMPLETE PROBLEMS  12 APPROXIMATION ALGORITHMS  13 PRAM ALGORITHMS  14.MESH ALGORITHMS  15.HYPERCUBE ALGORITHMS 
<br/><br/> This is the of the programming language-independent text that helped establish computer algorithms as a discipline of computer science. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. This book is appropriate as a core text for upper-and graduate-level courses in algorithms. 
<br/><br/><label>ISBN: </label>9788173716126 
<br/><br/><label>Dewey Class. No.: </label>004.421   / HOR