Project description
For many graph theoretic problems it takes exponential time to obtain an exact solution. However, fast heuristics can typically find optimal or near-optimal solutions in relatively short time, which is often sufficient for practical purposes. This project seeks to develop such a heuristic for an appropriate graph theoretic problem, and benchmark it against the existing algorithms in the literature.
Assumed knowledge
Programming skills (ideally MATLAB) An understanding of discrete mathematics (such as obtained in COMP2781 Computer Mathematics)
Industry involvement
Note: You need to register interest in projects from different supervisors (not a number of projects with the one supervisor).
You must also contact each supervisor directly to discuss both the project details and your suitability to undertake the project.