Algorithm design / Jon Kleinberg, Éva Tardos.
Material type: TextPublication details: London : Pearson/Addison-Wesley,2006 c2006.Description: xxiii, 838 p. : ill. ; 24 cmISBN:- 0321295358 (alk. paper)
- 005.1 K645
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Book - Borrowing | Central Library Lower Floor | 005.1 KLE (Browse shelf(Opens below)) | Available | 000004045 |
Includes bibliographical references (p. [805]-814) and index.
ntroduction: 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.