Algorithm design / Jon Kleinberg, Eva Tardos.
By: Kleinberg, Jon.
Contributor(s): Tardos, Eva.
Material type:
TextPublisher: Boston : Pearson/Addison-Wesley, c2006Description: xxiii, 838 p. : ill. ; 24 cm.ISBN: 0321295358 (alk. paper).Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1 Online resources: Table of contents | Item type | Current location | Call number | Status | Notes | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| Book | Chennai Mathematical Institute | 005.1 KLE (Browse shelf) | Not For Loan | Reserved for the semester Aug-Nov 2023. | 7747 |
Browsing Chennai Mathematical Institute Shelves Close shelf browser
|
|
|
|
|
|
No cover image available No cover image available | ||
| 005.1 JAL An integrated approach to software engineering / | 005.1 KLE Algorithm design / | 005.1 KLE Algorithm design / | 005.1 KLE Algorithm design / | 005.1 NIE Principles of program analysis / | 005.1 VAZ Approximation algorithms / | 005.1 VEN Computational thinking : a primer for programmers and data scientists/ |
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.