Advanced Algorithms - COMP781
Algorithms are the essence of computer science. In this unit we build on the undergraduate understanding of algorithms and look at interesting and useful algorithms, both fundamental and cutting edge. The particular material covered will depend on the cohort but may include topics such as approximation algorithms, exponential-time exact and parameterized algorithms, linear and constraint programming and fundamental graph algorithms such as max-flow algorithms, matching algorithms an so on. The unit will also employ appropriate tools from complexity theory to analyse the performance of the algorithms studied.
| Credit Points: | 4 |
| When Offered: | S1 Day - Session 1, North Ryde, Day |
| Staff Contact(s): | Professor Annabelle McIver, Associate Professor Franck Cassez |
| Prerequisites: |
Admission to MRes |
| Corequisites: | |
| NCCW(s): | |
| Unit Designation(s): | |
| Unit Type: | |
| Assessed As: | Graded |
| Offered By: | Department of Computing Faculty of Science and Engineering |
Course structures, including unit offerings, are subject to change.
Need help? Ask us.