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: 813170310X.Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1 Online resources: Table of contents
Contents:
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 -- Exte
Item type | Current location | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Book | Chennai Mathematical Institute | 005.1 KLE (Browse shelf) | Available | Reserved for the semester Aug-Nov 2022. | 4439 | ||
Book | Chennai Mathematical Institute | 005.1 KLE (Browse shelf) | Withdrawn Damaged | 4440 | |||
Book | Chennai Mathematical Institute | 005.1 KLE (Browse shelf) | Not For Loan | Reserved for the semester [Jan-Apr 2024] | 4441 |
Total holds: 0
Browsing Chennai Mathematical Institute Shelves Close shelf browser
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 -- Exte