| Book Name: | Algorithm Design |
| Category: | Algorithms |
| Free Download: | Available |
Algorithm Design
Book Description
This book introduces algorithms by looking at the real-world problems that drive them. The book teaches a variety of design and analysis techniques for problems that arise in computer applications. The text encourages an understanding of the algorithm design process and an appreciation for the role of algorithms in the larger field of computer science.
About Author
Jon Kleinberg is Tisch University Professor of Computer Science at Cornell University. His research deals with the interface of networks and information, with a focus on social networks and the information that underpins the web and other online media. Eva Tardos is a Hungarian mathematician and holder of the Jacob Gould Schurman chair in Computer Science at Cornell University.
Table of contents :
Table of Contents……Page 4
Chapter 1. Introduction: Some Representative Problems……Page 6
Chapter 2. Basics of Algorithm Analysis……Page 34
Chapter 3. Graphs……Page 78
Chapter 5. Divide and Conquer……Page 120
Chapter 4. Greedy Algorithms……Page 162
Chapter 6. Dynamic Programming……Page 256
Chapter 7. Network Flow……Page 342
Chapter 8. NP and Computational Intractability……Page 456
Chapter 9. PSPACE: A Class of Problems beyond NP……Page 536
Chapter 10. Extending the Limits of Tractability……Page 558
Chapter 11. Approximation Algorithms……Page 604
Chapter 13. Randomized Algorithms……Page 666
Chapter 12. Local Search……Page 754
Epilogue: Algorithms That Run Forever……Page 800
References……Page 810
Algorithm design PDF
Author(s): Kleinberg, Jon; Tardos, Éva
Publisher: Pearson, Year: 2013;2014
ISBN: 1292023945,9781292023946
