Algorithm design / Jon Kleinberg, Éva Tardos.
Material type:
TextPublication details: Boston : Pearson/Addison-Wesley, c2006.Description: xxiii, 838 p. : ill. ; 24 cmISBN: - 0321295358 (alk. paper)
- 9788131703106
- 005.1 22
- QA 76.9 .K54 2006
| Item type | Current library | Call number | Status | Barcode | |
|---|---|---|---|---|---|
| Books | The MUA Library South C campus - Open Collection | QA 76.9 .K54 2006 (Browse shelf(Opens below)) | Available | 2009-1406 |
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.
