Algorithm design / Jon Kleinberg, Éva Tardos.
Material type:
TextPublication details: New Delhi : Pearson Education, Inc., c2006.Description: xxiii, 838 p. : ill. ; 21 cmISBN: - 813170310X
- 005.1 22
- QA76.9.A43 K54 2006
| Item type | Current library | 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(Opens below)) | 1 | Available | 026320 | |||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf(Opens below)) | 2 | Available | 026316 | |||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf(Opens below)) | 3 | Available | 026318 | |||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf(Opens below)) | 4 | Available | 026317 | |||
|
Books
|
Uttara University Central Library General Stacks | Non-fiction | 005.1 K645a 2006 (Browse shelf(Opens below)) | 5 | Available | 026319 |
Browsing Uttara University Central Library shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 005.1 C811i 2009 Introduction to algorithms / | 005.1 C811i 2009 C-19 Introduction to algorithms / | 005.1 F911s 1995 C-1 Software assessment : | 005.1 K645a 2006 Algorithm design / | 005.1 K645a 2006 Algorithm design / | 005.1 K645a 2006 Algorithm design / | 005.1 K645a 2006 Algorithm design / |
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 on this title.