[Theory] REMINDER: 1/20 Talks at TTIC: Ohad Trabelsi, University of Michigan

[Mary Marre]

*When:*      Thursday, January 20th at* 11:00 am CT*



*Where:*     Zoom Virtual Talk (*register in advance here
<https://uchicagogroup.zoom.us/webinar/register/WN_NOO3cAfKR7-Ps3a2x7XJFg>*)


*Who: *       Ohad Trabelsi, University of Michigan


*Title*:        New Algorithms and Lower Bounds for All-Pairs Max-Flow

*Abstract*: When can maximum flow be solved for all pairs of nodes faster
than naively solving it separately for each pair? We will overview new
algorithms - including a very recent breakthrough!, and also lower bounds
(under some popular assumptions).

*Host:* *Julia Chuzhoy <cjulia at ttic.edu>*



Mary C. Marre
Faculty Administrative Support
*Toyota Technological Institute*
*6045 S. Kenwood Avenue*
*Chicago, IL  60637*
*mmarre at ttic.edu <mmarre at ttic.edu>*


On Wed, Jan 19, 2022 at 3:21 PM Mary Marre <mmarre at ttic.edu> wrote:

> *When:*      Thursday, January 20th at* 11:00 am CT*
>
>
>
> *Where:*     Zoom Virtual Talk (*register in advance here
> <https://uchicagogroup.zoom.us/webinar/register/WN_NOO3cAfKR7-Ps3a2x7XJFg>*
> )
>
>
> *Who: *       Ohad Trabelsi, University of Michigan
>
>
> *Title*:        New Algorithms and Lower Bounds for All-Pairs Max-Flow
>
> *Abstract*: When can maximum flow be solved for all pairs of nodes faster
> than naively solving it separately for each pair? We will overview new
> algorithms - including a very recent breakthrough!, and also lower bounds
> (under some popular assumptions).
>
> *Host:* *Julia Chuzhoy <cjulia at ttic.edu>*
>
>
>
> Mary C. Marre
> Faculty Administrative Support
> *Toyota Technological Institute*
> *6045 S. Kenwood Avenue*
> *Chicago, IL  60637*
> *mmarre at ttic.edu <mmarre at ttic.edu>*
>
>
> On Thu, Jan 13, 2022 at 3:31 PM Mary Marre <mmarre at ttic.edu> wrote:
>
>> *When:*      Thursday, January 20th at* 11:00 am CT*
>>
>>
>>
>> *Where:*     Zoom Virtual Talk (*register in advance here
>> <https://uchicagogroup.zoom.us/webinar/register/WN_NOO3cAfKR7-Ps3a2x7XJFg>*
>> )
>>
>>
>> *Who: *       Ohad Trabelsi, University of Michigan
>>
>>
>> *Title*:        New Algorithms and Lower Bounds for All-Pairs Max-Flow
>>
>> *Abstract*: When can maximum flow be solved for all pairs of nodes
>> faster than naively solving it separately for each pair? We will
>> overview new algorithms - including a very recent breakthrough!, and also
>> lower bounds (under some popular assumptions).
>>
>> *Host:* *Julia Chuzhoy <cjulia at ttic.edu>*
>>
>>
>>
>> Mary C. Marre
>> Faculty Administrative Support
>> *Toyota Technological Institute*
>> *6045 S. Kenwood Avenue*
>> *Chicago, IL  60637*
>> *mmarre at ttic.edu <mmarre at ttic.edu>*
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/theory/attachments/20220120/7c538a19/attachment-0001.html>