CSE464/564: Algorithms
Undergraduate & Graduate course, Miami University, Department of Computer Science and Software Engineering, 2016
This course covers the design and analysis of algorithms, including topics such as dynamic programming, graph algorithms, and NP-completeness. Graduate students are expected to explore advanced topics in approximation algorithms and randomized algorithms.
Key Topics:
- Divide and conquer
- Graph algorithms (e.g., shortest path, network flows)
- Dynamic programming
- NP-completeness
- Approximation algorithms (for CSE564)