Algorithm design Jon Kleinberg, Eva Tardos.
Publisher: Boston : Pearson/Addison-Wesley, c2006Description: xxiii, 838 p. : ill. ; 24 cmISBN: 0321295358Subject(s): Computer algorithms | Data structures (Computer science)
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 | Home library | Collection | Shelving location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|---|
Book
|
Central Library (CL) | Central Library (CL) | NFIC | First Floor - Software Engineering/ Programming Language | 005.1 KLE (Browse shelf) | Available | SEECS012946 | ||
|
Book
|
Central Library (CL) | Central Library (CL) | NFIC | First Floor - Software Engineering/ Programming Language | 005.1 KLE (Browse shelf) | Available | SEECS009641 | ||
|
Book
|
Central Library (CL) | Central Library (CL) | NFIC | First Floor - Software Engineering/ Programming Language | 005.1 KLE (Browse shelf) | Available | SEECS009640 | ||
|
Book
|
Central Library (CL) | Central Library (CL) | NFIC | First Floor - Software Engineering/ Programming Language | 005.1 KLE (Browse shelf) | Available | SEECS009639 |
Total holds: 0
Browsing Central Library (CL) shelves, Shelving location: First Floor - Software Engineering/ Programming Language Close shelf browser
| 005.1 KIS Software Requirements and Estimation | 005.1 KLE Algorithm design | 005.1 KLE Algorithm design | 005.1 KLE Algorithm design | 005.1 KLE Algorithm design | 005.1 KNU The art of computer programming : fundamental algorithms (vol 1) | 005.1 KNU The art of computer programming : Seminumerical algorithms (Vol. 2) |
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.