Algorithm Design, Pearson New International Edition, 1st edition

Published by Pearson (August 29, 2013) © 2014

  • Jon Kleinberg Cornell University
  • Eva Tardos Cornell University
Products list
$85.95 NZD
Instant access
Products list
$144.43 NZD

Price Reduced From: $192.57 NZD

Free delivery

Details

  • A print text
  • Free shipping

This product is expected to ship within 10-12 business days for New Zealand customers

Title overview

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Table of contents

  • 1 Introduction: Some Representative Problems
  • 2 Basics of Algorithms Analysis
  • 3 Graphs
  • 4 Divide and Conquer
  • 5 Greedy Algorithms
  • 6 Dynamic Programming
  • 7 Network Flow
  • 8 NP and Computational Intractability
  • 9 PSPACE: A Class of Problems Beyond NP
  • 10 Extending the Limits of Tractability
  • 11 Approximation Algorithms
  • 12 Randomized Algorithms
  • 13 Local Search
  • Epilogue: Algorithms that Run Forever
  • References
  • Index

Need help?Get in touch