The study of computational problems on graphs has long been a central area of research in computer science. However, recent years have seen qualitative changes in both the problems to be solved and the tools available to do so. Application areas such as computational biology, the web, social networks, and machine learning give rise to large graphs and complex statistical questions that demand new algorithmic ideas and computational models. At the same time, techniques such as semidefinite programming and combinatorial preconditioners have been emerging for addressing these challenges.
The Spring 2014 semester program brings together leading experts from academia and industry and early career researchers to advance several exciting areas of research including:
(1) Electrical flows, Laplacian solvers, and graph preconditioners
(2) Semidefinite programs, and their use in machine learning
(3) Stochastic graphs, their models and applications
(4) Optimization algorithms on planar graphs and related graph classes
There will be four international conferences associated with this program, including an applications-oriented opening event.