Algorithm design / Jon Kleinberg, Éva Tardos.
By: Kleinberg, Jon.
Contributor(s): Tardos, Éva.
Material type:
BookPublisher: New Delhi : Pearson/Addison-Wesley, c2014Description: 824p. : ill. ; 25 cm.ISBN: 9789332518643.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 |
|---|---|---|---|---|---|---|
Books
|
Eastern University Library General Stacks | 005.1 KLA 2014 (Browse shelf) | Not For Loan | 15315 | ||
|
Books
|
Eastern University Library General Stacks | 005.1 KLA 2014 (Browse shelf) | Available | Permanent Campus Library | 15316 | |
|
Books
|
Eastern University Library General Stacks | 005.1 KLA 2014 (Browse shelf) | Available | Permanent Campus Library | 15317 | |
|
Books
|
Eastern University Library General Stacks | 005.1 KLA 2014 (Browse shelf) | Available | 15318 | ||
|
Books
|
Eastern University Library General Stacks | 005.1 KLA 2014 (Browse shelf) | Available | Permanent Campus Library | 15319 |
Browsing Eastern University Library Shelves , Shelving location: General Stacks Close shelf browser
|
|
|
|
|
|
No cover image available No cover image available | ||
| 005.1 KES 2016 System analysis and design / | 005.1 KLA 2014 Algorithm design / | 005.1 KLA 2014 Algorithm design / | 005.1 KLA 2014 Algorithm design / | 005.1 KLA 2014 Algorithm design / | 005.1 KLA 2014 Algorithm design / | 005.1 KNA 1997 The art of computer programming : |
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.
There are no comments for this item.