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

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

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

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