Kleinberg, Jon. <br/><br/>
Algorithm design / 
Jon Kleinberg, Éva Tardos. 
 - New Delhi :  Pearson Education, Inc.,  c2006. 
 - xxiii, 838 p. :  ill. ;  21 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/><label>ISBN: </label>813170310X 
<br/><br/><label>LCCN: </label>2005000401 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer algorithms.<br/>Data structures (Computer science)
<br/><br/><label>LC Class. No.: </label>QA76.9.A43  / K54 2006 
<br/><br/><label>Dewey Class. No.: </label>005.1