Algorithm design
By: Jon Kleinberg, Éva Tardos
Contributors: Tardos, Éva
Publisher: Pearson/Addison-Wesley
Published: 2006
Place of publication: Boston
Language: eng
Number of pages: 838
Subjects: Computer algorithms; Data structures (Computer science)
Description: "Algorithm Design takes a fresh approach to the algorithms course, introducing algorithmic ideas through the real-world problems that motivate them. In a clear, direct style, Jon Kleinberg and Eva Tardos teach students to analyze and define problems for themselves, and from this to recognize which design principles are appropriate for a given situation. The text encourages a greater understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science."--Jacket.
Notes: Includes bibliographical references (p. [805]-814) and index
Table of contents: title: Introduction: Some representative problems; title: Basics of algorithms analysis; title: Graphs; title: Greedy algorithms; title: Divide and conquer; title: Dynamic programming; title: Network flow; title: NP and computational intractability; title: PSPACE: A class of problems beyond NP; title: Extending the limits of tractability; title: Approximation algorithms; title: Local search; title: Randomized algorithms; title: Epilogue: algorithms that run forever