Algorithm design / Jon Kleinberg, Éva Tardos.
By: Kleinberg, Jon
.
Contributor(s): Tardos, Éva.
Material type: 
TextPublisher: New Delhi : Pearson Education, Inc., c2006Description: xxiii, 838 p. : ill. ; 21 cm.ISBN: 813170310X.Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1 | Item type | Current location | Collection | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf) | 1 | Available | 026320 | ||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf) | 2 | Available | 026316 | ||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf) | 3 | Available | 026318 | ||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf) | 4 | Available | 026317 | ||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf) | 5 | Available | 026319 |
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.