Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

Banach spaces, as complete normed vector spaces, form a central framework in modern functional analysis. Their rich geometric structure underpins much of the theoretical development in approximation ...

We present a probabilistic greedy search method for combinatorial optimisation problems. This approach is implemented and evaluated for the Set Covering Problem (SCP) and shown to yield a simple, ...

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