Algorithm design /
by Kleinberg, Jon; Tardos, Éva.
Material type:
BookPublisher: Boston : Pearson/Addison-Wesley, c2006Description: xxiii, 838 p. : ill. ; 24 cm.ISBN: 0321295358 (alk. paper); 9788131703106.Subject(s): Computer algorithms | Data structures (Computer science)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 -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever.
| Item type | Current location | Collection | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Books
|
Dhaka University Science Library General Stacks | Non Fiction | 005.1 KLA (Browse shelf) | 3 | Available | 451700 | |
|
Books
|
Dhaka University Science Library General Stacks | Non Fiction | 005.1 KLA (Browse shelf) | 4 | Available | 452957 | |
|
Books
|
Dhaka University Science Library General Stacks | Non Fiction | 005.1 KLA (Browse shelf) | 7 | Available | 459311 |
Browsing Dhaka University Science Library Shelves , Shelving location: General Stacks , Collection code: Non Fiction Close shelf browser
|
|
|
|
|
|
|
||
| 005.1 KAU Understanding pointers in C / | 005.1 KAU Understanding pointers in C / | 005.1 KHS Software quality : | 005.1 KLA Algorithm design / | 005.1 KLA Algorithm design / | 005.1 KLA Algorithm design / | 005.1 LIC C++, an introduction to 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.