Table of contents for Algorithm design / Jon Kleinberg, Eva Tardos.

Bibliographic record and links to related information available from the Library of Congress catalog.

Note: Contents data are machine generated based on pre-publication provided by the publisher. Contents may have variations from the printed book or be incomplete or contain other coding.

Introduction: Some Representative Problems
Basics of Algorithms Analysis
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

Library of Congress Subject Headings for this publication:

Computer algorithms.
Data structures (Computer science).