Kleinberg, Jon.
Algorithm design / Jon Kleinberg, Éva Tardos. - New Delhi : Pearson/Addison-Wesley, c2014. - 824p. : ill. ; 25 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.
9789332518643
Computer algorithms.
Data structures (Computer science)
005.1 / KLA 2014
Algorithm design / Jon Kleinberg, Éva Tardos. - New Delhi : Pearson/Addison-Wesley, c2014. - 824p. : ill. ; 25 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.
9789332518643
Computer algorithms.
Data structures (Computer science)
005.1 / KLA 2014