ARC Future Fellowships - Grant ID: FT140100048

Funding Activity

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

Algorithms for hard graph problems based on auxiliary data. When solving computational problems, algorithms usually access only the data that is absolutely necessary to define the problem. However, much more data is often readily available. Especially for important or slowly evolving data, such as road networks, social graphs, company rankings, or molecules, more and more auxiliary data becomes available through computational processes, sensors, and simple user entries. This auxiliary data can greatly speed up an algorithm and improve its accuracy. This project aims to design improved algorithms that harness auxiliary data to solve selected high-impact NP-hard graph problems, and will build a new empowering theory to discern when auxiliary data can be used to improve algorithms.

Funded Activity Details

Start Date: 01-06-2015

End Date: 31-05-2019

Funding Scheme: ARC Future Fellowships

Funding Amount: $711,489.00

Funder: Australian Research Council