NOTES PERTAINING TO PUBLICATION, DISTRIBUTION, ETC.
Text of Note
Print
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
index
Text of Note
Includes bibliographical references (p. [805]-814)
CONTENTS NOTE
Text of Note
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.