Algorithm design - Kleinberg, Jon.; Tardos, Éva. (Boston ; New Delhi : Pearson/Addison-Wesley, 2006)
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.
Includes bibliographical references (p. [805]-814) and index.
Keywords: Computer algorithms; Data structures (Computer science)