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

From greedy methods to dynamic programming, mastering algorithm design is about more than theory—it’s about crafting solutions that are efficient, scalable, and practical. Whether you’re preparing for ...

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

In life, we sometimes have to make decisions without all the information we want; that’s true in computer science, too. This is the realm of online algorithms — which, despite their name, don’t ...

From greedy shortcuts to dynamic programming guarantees, algorithm design techniques are the backbone of efficient problem-solving in computer science. Understanding when and how to apply each ...

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