Kleinberg, Jon.

Algorithm design / - Boston : Pearson/Addison-Wesley, c2006. - xxiii, 838 p. : ill. ;

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


Computer algorithms.
Data structures (Computer science)

681.3.02 / KLE
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha