The goal of this project is to study graph theory for local methods and global good. The project will focus on analyzing the connection between local and global properties, designing the eﬃcient data structure under local adjustment and understanding the capacity and limit of the local method in many combinatorial problems, such as network-ﬂow problems, dynamic graph problem and multi-agent system design. Studying such local routine from the perspectives of numerical and combinatorial algorithms will bring together a variety of techniques to form new algorithmic frameworks.
Gary Miller (Chair)
Sushant Sachdeva (University of Toronto)
Richard Peng (Georgia Institute of Technology)