Algorithms for Future-Proof Networks. This project will design algorithms to construct, augment and route on geometric graphs in the presence of obstacles. Such graphs have many real-world application

Description

Algorithms for Future-Proof Networks. This project will design algorithms to construct, augment and route on geometric graphs in the presence of obstacles. Such graphs have many real-world applications, including transport networks. This project aims to give solutions with hard guarantees on the timeliness of the delivery of the people, goods, or information being transported in these networks. Expected outcomes of this project include efficient and innovative algorithms for realistic geometric graphs, which both advances the knowledge in this field of computer science and make our existing networks more reliable. This should provide significant benefits in the maintenance and utilisation of the communication and transport networks we use every day.. Scheme: Discovery Projects. Field: 4613 - Theory of Computation. Lead: Prof Joachim Gudmundsson