Algorithm Design, 1st edition

Published by Pearson (July 14, 2021) © 2006

  • Jon Kleinberg Cornell University
  • Eva Tardos Cornell University
Products list

Algorithm Design introduces you to algorithms and the real-world problems that motivate them. You'll learn a range of design and analysis techniques for problems that arise in computing applications. You'll also come to understand the algorithm design process and recognise the role of algorithms in computer science.

  • 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
  • References
  • Index

This fixed-layout publication may lack compatibility with assistive technologies. Images in the publication lack alternative text descriptions. The publication does not support text reflow. The publication contains no content hazards known to cause adverse physical reactions.

Need help? Get in touch