SKOLKOVO School of Management

Normal view MARC view ISBD view

Algorithm design / Jon Kleinberg, Éva Tardos.

By: Kleinberg, Jon.
Contributor(s): Tardos, Éva.
Publisher: 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.
Tags from this library: No tags from this library for this title.
Item type Current location Call number Status Date due Barcode Item holds
Book Skoltech library
Shelves
QA76.9.A43 K54 2006 (Browse shelf) Available 2000006732
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.

There are no comments for this item.

Log in to your account to post a comment.