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.
Preface 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 Bibliography Index
Library of Congress Subject Headings for this publication:
Data structures (Computer science).