This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

In 1996, Dor, Halperin, and Zwick introduced an influential method that delivered a “2-approximation” in nearly optimal time.

The Foundations of Data Structures and Algorithms specialization includes two optional preparation courses and a three-course pathway to earn admission to the Online MS in Computer Science. You must ...