Banner

Algorithm design / Jon Kleinberg, Éva Tardos.

By: Kleinberg, Jon
Contributor(s): Tardos, Éva
Material type: TextTextPublisher: London : Pearson/Addison-Wesley,2006 c2006Description: xxiii, 838 p. : ill. ; 24 cmISBN: 0321295358 (alk. paper)Subject(s): Computer algorithms | Data structures (Computer science)DDC classification: 005.1
Contents:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
Book - Borrowing Book - Borrowing Central Library
Lower Floor
005.1 KLE (Browse shelf) Available 000004045
Total holds: 0

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 for this item.

to post a comment.