[Colloquium] REMINDER: 4/21 Research at TTIC: Julia Chuzhoy, TTIC

[Mary Marre via Colloquium]

When:     Friday, April 21st at noon



Where:    TTIC, 6045 S Kenwood Avenue, 5th Floor, Room 526



Who:       Julia Chuzhoy; TTIC


Title: New Approximation Algorithms and Hardness Results for Graph Routing
Problems

Abstract: This talk will mostly focus on the Node-Disjoint Paths problem.
This is a basic graph routing problem, in which the input consists of a
graph G together with a collection {(s_1,t_1),...,(s_k,t_k)} of pairs of
its vertices, called demand pairs. The goal is to connect as many of the
demand pairs as possible by paths that are disjoint in both their edges and
vertices. Until recently, the approximability of this problem was widely
open: a simple greedy O(\sqrt n)-approximaiton algorithm was the best known
algorithm even for restricted special cases of the problem, such as planar
graphs and grid graphs. On the negative side, only roughly
\Omega(\sqrt{\log n})-hardness of approximation was known for general
graphs, and only APX-hardness for planar graphs and grids. In this talk we
will survey several recent developments on both the algorithmic and
hardness of approximation fronts, that come close to resolving the
approximation complexity of this problem, in a somewhat surprising way.


Based on joint work with David H. K. Kim, Shi Li and Rachit Nimavat.


********************************************************************************************************

*Research at TTIC Seminar Series*

TTIC is hosting a weekly seminar series presenting the research currently
underway at the Institute. Every week a different TTIC faculty member will
present their research.  The lectures are intended both for students
seeking research topics and adviser, and for the general TTIC and
University of Chicago communities interested in hearing what their
colleagues are up to.

To receive announcements about the seminar series, please subscribe to the
mailing list: https://groups.google.com/a/ttic.edu/group/talks/subscribe

Speaker details can be found at: http://www.ttic.edu/tticseminar.php.

For additional questions, please contact Nathan Srebro at nati at ttic.edu
<mcallester at ttic.edu>




Mary C. Marre
Administrative Assistant
*Toyota Technological Institute*
*6045 S. Kenwood Avenue*
*Room 504*
*Chicago, IL  60637*
*p:(773) 834-1757*
*f: (773) 357-6970*
*mmarre at ttic.edu <mmarre at ttic.edu>*

On Fri, Apr 14, 2017 at 2:25 PM, Mary Marre <mmarre at ttic.edu> wrote:

> When:     Friday, April 21st at noon
>
>
>
> Where:    TTIC, 6045 S Kenwood Avenue, 5th Floor, Room 526
>
>
>
> Who:       Julia Chuzhoy; TTIC
>
>
> Title: New Approximation Algorithms and Hardness Results for Graph Routing
> Problems
>
> Abstract: This talk will mostly focus on the Node-Disjoint Paths problem.
> This is a basic graph routing problem, in which the input consists of a
> graph G together with a collection {(s_1,t_1),...,(s_k,t_k)} of pairs of
> its vertices, called demand pairs. The goal is to connect as many of the
> demand pairs as possible by paths that are disjoint in both their edges and
> vertices. Until recently, the approximability of this problem was widely
> open: a simple greedy O(\sqrt n)-approximaiton algorithm was the best known
> algorithm even for restricted special cases of the problem, such as planar
> graphs and grid graphs. On the negative side, only roughly
> \Omega(\sqrt{\log n})-hardness of approximation was known for general
> graphs, and only APX-hardness for planar graphs and grids. In this talk we
> will survey several recent developments on both the algorithmic and
> hardness of approximation fronts, that come close to resolving the
> approximation complexity of this problem, in a somewhat surprising way.
>
>
> Based on joint work with David H. K. Kim, Shi Li and Rachit Nimavat.
>
>
>
> ********************************************************************************************************
>
> *Research at TTIC Seminar Series*
>
> TTIC is hosting a weekly seminar series presenting the research currently
> underway at the Institute. Every week a different TTIC faculty member
> will present their research.  The lectures are intended both for students
> seeking research topics and adviser, and for the general TTIC and
> University of Chicago communities interested in hearing what their
> colleagues are up to.
>
> To receive announcements about the seminar series, please subscribe to the
> mailing list: https://groups.google.com/a/ttic.edu/group/talks/subscribe
>
> Speaker details can be found at: http://www.ttic.edu/tticseminar.php.
>
> For additional questions, please contact Nathan Srebro at nati at ttic.edu
> <mcallester at ttic.edu>
>
>
>
>
>
> Mary C. Marre
> Administrative Assistant
> *Toyota Technological Institute*
> *6045 S. Kenwood Avenue*
> *Room 504*
> *Chicago, IL  60637*
> *p:(773) 834-1757 <(773)%20834-1757>*
> *f: (773) 357-6970 <(773)%20357-6970>*
> *mmarre at ttic.edu <mmarre at ttic.edu>*
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20170420/8a9962b3/attachment-0001.html>