CMI Library

Your cart is empty.
Normal view MARC view ISBD view

Algorithm design / Jon Kleinberg, Eva Tardos.

By: Kleinberg, Jon.
Contributor(s): Tardos, Eva.
Material type: TextTextPublisher: Boston : Pearson/Addison-Wesley, c2006Description: xxiii, 838 p. : ill. ; 24 cm.ISBN: 0321295358 (alk. paper).Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1 Online resources: Table of contents
Contents:
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.
Summary: Gifted by Sourav Chakraborty.
List(s) this item appears in: Reserved Aug-Nov 2018 | Reserved for the semester Aug-Nov 2022
Item type Current location Call number Status Notes Date due Barcode Item holds
Book Chennai Mathematical Institute
005.1 KLE (Browse shelf) Not For Loan Reserved for the semester Aug-Nov 2023. 7747
Total holds: 0

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.

Gifted by Sourav Chakraborty.