Combinatorial optimisation problems arise in many fields, from logistics and network design to machine learning and bioinformatics. Most classical formulations are NP-hard, rendering exact ...

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

Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...

The stochastic root-finding problem is that of finding a zero of a vector-valued function known only through a stochastic simulation. The simulation-optimization problem is that of locating a ...

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 ...

*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 computer science, the research area of algorithms investigates formal procedures for solving computational problems, emphasizing correctness, efficiency, and resource optimization. It encompasses ...