Algorithm design /
Kleinberg, Jon,
Algorithm design / Jon Kleinberg and Éva Tardos. - Boston : Pearson, c2006. - xxiii, 838 p. : ill. ; 24 cm.
Includes bibliographical references (p. [805]-814) and index
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.
0321372913
Computer algorithms
Data structures (Computer science)
QA76.9 / .A43K54 2006
005.1 / K64a
Algorithm design / Jon Kleinberg and Éva Tardos. - Boston : Pearson, c2006. - xxiii, 838 p. : ill. ; 24 cm.
Includes bibliographical references (p. [805]-814) and index
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.
0321372913
Computer algorithms
Data structures (Computer science)
QA76.9 / .A43K54 2006
005.1 / K64a