CS 330 Fall 2023 | Intro to Design & Analysis of Algorithms (original) (raw)
| Design techniques: Divide-and-conquer, dynamic programming, greedy algorithms, parallel algorithms, randomized algorithms | Graph algorithms: Graph traversal, shortest path, minimum spanning tree, max flows and minimum cuts, matching |
|---|---|
| Intractability: Easy and hard problems, decision problems, NP-Completeness, reducibility | Large scale computing: Clustering, hashing, sketching, streaming, approximation algorithms |