[talks] Colloquium Speaker Julia Chuzhoy Tuesday, May 12, 12:30pm
Nicole E. Wagenblast
nwagenbl at CS.Princeton.EDU
Fri May 8 14:51:58 EDT 2015
Julia Chuzhoy , from Toyota Technological Institute at Chicago
Tuesday, May 12, 12:30pm
Computer Science 105
Approximation Algorithms for Graph Routing Problems
In a typical routing problem, we are given a graph G, and a collection (s_1,t_1),…,(s_k,t_k) of pairs of vertices, called demand pairs, that we would like to route. In order to route a demand pair (s_i,t_i), we need to choose a path connecting s_i to t_i in G. Our goal is usually to route as many of the demand pairs as possible, while keeping the congestion of the routing - the maximum load on any vertex or an edge of G - as small as possible. This general framework gives rise to a number of basic and widely studied graph routing problems, that have lead to the development of a rich toolkit of algorithmic techniques, as well as structural graph theoretic results. In this talk we will describe some of the recent developments in approximation algorithms for graph routing problems, and highlight some connections between this area and graph theory.
Julia Chuzhoy is an Associate Professor at the Toyota Technological Institute at Chicago (TTIC). She received her Ph.D. in Computer Science from Technion, Israel in 2004, and spent several years as a postdoc at MIT, University of Pennsylvania and Institute for Advanced Study, before joining TTIC in 2007. Her research area is theoretical computer science, with the main emphasis on the design and the analysis of approximation algorithms for NP-hard problems.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the talks