This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented.
Ik heb een vraag over het boek: ‘Techniques for Designing and Analyzing Algorithms - Stinson, Douglas R. (University of Waterloo’.
Vul het onderstaande formulier in.
We zullen zo spoedig mogelijk antwoorden.
