Algorithm design / Jon Kleinberg, Éva Tardos.
By: Kleinberg, Jon
.
Contributor(s): Tardos, Éva
.
Material type:
BookPublisher: Boston : Pearson/Addison-Wesley, c2006Description: xxiii, 838 p. : ill. ; 24 cm.ISBN: 0321295358 (alk. paper).Subject(s): Computer algorithms| Item type | Current location | Collection | Call number | Status | Notes | Date due | Item holds |
|---|---|---|---|---|---|---|---|
|
|
General Stacks | Non-fiction | QA76.9.A43 K54 2006 (Browse shelf) | Available | EG |
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 for this item.