Algorithm design / Jon Kleinberg, Éva Tardos.
Material type:
TextPublisher: Boston : Pearson/Addison-Wesley, 2006Description: xxiii, 838 p. : ill. ; 24 cmISBN: 0321295358 (alk. paper)Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1 LOC classification: QA76.9.A43 | K54 2006Online resources: Table of contents | Item type | Current location | Home library | Shelving location | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|---|
Book
|
NUST Baluchistan Campus (NBC) | NUST Baluchistan Campus (NBC) | Book Cart | 005.1 KLE (Browse shelf) | 1 | Available | Q-6 |
Browsing NUST Baluchistan Campus (NBC) shelves, Shelving location: Book Cart Close shelf browser
| 005.1 COR Introduction to algorithms / | 005.1 COR Introduction to algorithms / | 005.1 COR Introduction to algorithms / | 005.1 KLE Algorithm design / | 005.1 PRE Software engineering : | 005.1 PRE Software engineering : | 005.1 PRE Software engineering : |
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.