Algorithm design / Jon Kleinberg, �Eva Tardos.
Material type:
TextPublication details: Boston : Pearson/Addison-Wesley, c2006.Description: xxiii, 838 p. : ill. ; 24 cmContent type: - text
- unmediated
- volume
- 0321295358
- 9780321295354
- 005.1 22
- QA76.9.A43 K54 2006
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
Books in General collection
|
Mzuni ODeL- Balaka Satellite Centre Library | QA 76.9.A43 KLE 2006 (Browse shelf(Opens below)) | 034832 | Available | mZUlm-034832 |
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.