|
Subject name: Design and Analysis of Algorithms I |
|
Author : Topic content : |
|
This course emphasizes on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include computational geometry, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity. approximate approaches.
|