Algorithm design
Kleinberg, Jon
Algorithm design by Jon Kleinberg, Eva Tardos. - Boston : Pearson Education, ©2006. - 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.
9788131703106
2005000401
Computer algorithms.
Data structures (Computer science)
QA76.9.A43 / K54 2006
005.1 / KLE-A
Algorithm design by Jon Kleinberg, Eva Tardos. - Boston : Pearson Education, ©2006. - 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.
9788131703106
2005000401
Computer algorithms.
Data structures (Computer science)
QA76.9.A43 / K54 2006
005.1 / KLE-A