کتاب طراحی الگوریتم کلینبرگ و تاردوس
کتاب طراحی الگوریتم کلینبرگ و تاردوس
- انتشارات:Addison Wesley
- توسط:Éva Tardos, Jon Kleinberg
- ISBN:9780321295354
- تاریخ انتشار:2005
- تعداد صفحات:864
- زبان:English
- نوع فایل: PDF
لینک‌هایی که باید ببینید:
- جهت مشاهده سایر کتاب‌ها کلیک کنید
- برای مشاوره رایگان کنکور (در تلگرام) پیام بدهید.
- .برای مشاهده ویدئو‌های آموزش و نکته و تست کنکور کامپیوتر کلیک کنید
خلاصه کتاب طراحی الگوریتم کلینبرگ و تاردوس:
“Algorithm Design” by Jon Kleinberg and Éva Tardos is a textbook that provides an introduction to the design and analysis of algorithms. Here is a brief summary of some of the key concepts covered in the book:
Algorithmic Thinking: The book begins with an introduction to algorithmic thinking, including problem formulation, problem-solving strategies, and algorithm design paradigms.
Graph Algorithms: Kleinberg and Tardos cover a wide range of graph algorithms, including depth-first search, breadth-first search, shortest paths, minimum spanning trees, and network flow.
Greedy Algorithms: The book covers greedy algorithms, which make locally optimal choices at each step to find a global optimum. Examples include Huffman coding, Kruskal’s algorithm, and Dijkstra’s algorithm.
Divide and Conquer Algorithms: The book covers divide and conquer algorithms, which break a problem into smaller subproblems and solve them recursively. Examples include merge sort, quicksort, and the Strassen algorithm for matrix multiplication.
Dynamic Programming: Kleinberg and Tardos cover dynamic programming, which solves problems by breaking them into smaller subproblems and storing the solutions to these subproblems. Examples include the Knapsack problem, the Longest Common Subsequence problem, and the Bellman-Ford algorithm for shortest paths.
NP-Hard Problems: The book covers NP-hard problems, which are computationally intractable and have no known polynomial-time algorithms. Examples include the Traveling Salesman Problem, the Vertex Cover Problem, and the Subset Sum Problem.
Overall, “Algorithm Design” is a comprehensive textbook that provides a thorough introduction to algorithmic thinking and covers a wide range of algorithms and algorithm design paradigms. The book is suitable for students and professionals in computer science, engineering, and related fields who are interested in the design and analysis of algorithms.
:سرفصل ها
– 1 Introduction: Some Representative Problems
– 2 Basics of Algorithm Analysis
– 3 Graphs
– 4 Greedy Algorithms
– 5 Divide and Conquer
– 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 Local Search
– 13 Randomized Algorithms
– Epilogue: Algorithms That Run Forever
دیدگاهتان را بنویسید