Kleinberg, Jon <br/><br/>
Algorithm design / 
Jon Kleinberg, Éva Tardos. 
 - Pearson new international edition. First edition. 
 - ii, 823 pages :  illustrations ;  29 cm 
<br/><br/>Includes bibliographical references 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>9781292023946 1292023945 
<br/><br/><label>Nat. Bib. No.: </label>GBB443068  bnb 
<br/><br/><label>Nat. Bib. Agency Control No.: </label>016539175  Uk 
<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 2014