Algorithm design / Jon Kleinberg, Eva Tardos.
By: Kleinberg, Jon.
Contributor(s): Tardos, Eva.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Book | Chennai Mathematical Institute | 005.1 KLE (Browse shelf) | Available | 7747 |
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.
Gifted by Sourav Chakraborty.