Algorithm design / Jon Kleinberg, Éva Tardos.
Material type:
TextPublication details: Boston : Pearson/Addison-Wesley, c2006.Description: xxiii, 838 p. : ill. ; 24 cmISBN: - 9789332518643
- 005.1 22 KLE
- QA76.9.A43 K54 2006
| Item type | Current library | Collection | Call number | Status | Notes | Barcode | |
|---|---|---|---|---|---|---|---|
Books
|
LRC General Stacks | Non-fiction | 005.1 KLE (Browse shelf(Opens below)) | Available | Computer Book | B0043573 |
Include Index
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.