This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. Same as DTSA 5503.
instructor(s)
Sankaranarayanan, Sriram
Primary Instructor
- Fall 2023 / Spring 2024 / Summer 2024 / Fall 2024 / Spring 2025 / Summer 2025 / Fall 2025
