Kleinberg, Jon. <br/><br/>
Algorithm design / 
Jon Kleinberg, Eva Tardos. 
 - Boston :  Pearson/Addison-Wesley,  2006. 
 - xxiii, 838 p. :  ill. ;  24 cm. 
<br/><br/>Includes bibliographical references (p. [805]-814) and index. 
<br/><br/>Introduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever. 
<br/><br/>
<br/><br/><label>ISBN: </label>0321295358 (alk. paper)  RM333.00 
<br/><br/><label>LCCN: </label>2005-000401 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer algorithms.<br/>Data structures (Computer science).