[Theory] TODAY: 1/30 TTIC Colloquium: Chandra Chekuri, University of Illinois, Urbana-Champaign

[Mary Marre]

*When:*        Tuesday, January 30, 2024 at* 11:00** a**m CT   *


*Where:       *Talk will be given *live, in-person* at

                   TTIC, 6045 S. Kenwood Avenue

                   5th Floor, Room 530


*Who: *         Chandra Chekuri, University of Illinois, Urbana-Champaign

------------------------------

*Title: * Algorithms, (Combinatorial) Optimization and Applications

*Abstract:* I will give an overview of some recent research projects that
highlight the nice interplay between algorithms, discrete/combinatorial
optimization,
continuous optimization, and applications. A few topics that I hope to
cover:


   - Recent developments on the densest subgraph problem and connections to
   iterative algorithms and supermodularity
   - Polyhedral results on feedback vertex set and related problems
   - Fair clustering and fair allocations
   - Old and new models in network design

I will highlight several open problems along the way.

*Bio: *Chandra Chekuri is the Paul and Cynthia Saylor Professor in the
Department of Computer Science at University of Illinois, Urbana-Champaign.
He joined the university in 2006 after spending eight years at Lucent Bell
Labs. Prior to that he received his PhD from Stanford University and an
undergraduate degree from IIT Chennai. He is interested in the design and
analysis of algorithms, combinatorial optimization, mathematical
programming, and theoretical computer science. His technical contributions
have been mainly on (fast) approximation algorithms, graphs and networks,
scheduling, and submodular optimization.

*Host:* *Avrim Blum* <avrim at ttic.edu>


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


On Mon, Jan 29, 2024 at 3:40 PM Mary Marre <mmarre at ttic.edu> wrote:

> *When:*        Tuesday, January 30, 2024 at* 11:00** a**m CT   *
>
>
> *Where:       *Talk will be given *live, in-person* at
>
>                    TTIC, 6045 S. Kenwood Avenue
>
>                    5th Floor, Room 530
>
>
> *Who: *         Chandra Chekuri, University of Illinois, Urbana-Champaign
>
> ------------------------------
>
> *Title: * Algorithms, (Combinatorial) Optimization and Applications
>
> *Abstract:* I will give an overview of some recent research projects that
> highlight the nice interplay between algorithms, discrete/combinatorial
> optimization,
> continuous optimization, and applications. A few topics that I hope to
> cover:
>
>
>    - Recent developments on the densest subgraph problem and connections
>    to iterative algorithms and supermodularity
>    - Polyhedral results on feedback vertex set and related problems
>    - Fair clustering and fair allocations
>    - Old and new models in network design
>
> I will highlight several open problems along the way.
>
> *Bio: *Chandra Chekuri is the Paul and Cynthia Saylor Professor in the
> Department of Computer Science at University of Illinois, Urbana-Champaign.
> He joined the university in 2006 after spending eight years at Lucent Bell
> Labs. Prior to that he received his PhD from Stanford University and an
> undergraduate degree from IIT Chennai. He is interested in the design and
> analysis of algorithms, combinatorial optimization, mathematical
> programming, and theoretical computer science. His technical contributions
> have been mainly on (fast) approximation algorithms, graphs and networks,
> scheduling, and submodular optimization.
>
> *Host:* *Avrim Blum* <avrim at ttic.edu>
>
>
>
>
>
> Mary C. Marre
> Faculty Administrative Support
> *Toyota Technological Institute*
> *6045 S. Kenwood Avenue, Rm 517*
> *Chicago, IL  60637*
> *773-834-1757*
> *mmarre at ttic.edu <mmarre at ttic.edu>*
>
>
> On Thu, Jan 25, 2024 at 8:42 PM Mary Marre <mmarre at ttic.edu> wrote:
>
>> *When:*        Tuesday, January 30, 2024 at* 11:00** a**m CT   *
>>
>>
>> *Where:       *Talk will be given *live, in-person* at
>>
>>                    TTIC, 6045 S. Kenwood Avenue
>>
>>                    5th Floor, Room 530
>>
>>
>> *Who: *         Chandra Chekuri, University of Illinois, Urbana-Champaign
>>
>> ------------------------------
>>
>> *Title: * Algorithms, (Combinatorial) Optimization and Applications
>>
>> *Abstract:* I will give an overview of some recent research projects
>> that highlight the nice interplay between algorithms,
>> discrete/combinatorial optimization,
>> continuous optimization, and applications. A few topics that I hope to
>> cover:
>>
>>
>>    - Recent developments on the densest subgraph problem and connections
>>    to iterative algorithms and supermodularity
>>    - Polyhedral results on feedback vertex set and related problems
>>    - Fair clustering and fair allocations
>>    - Old and new models in network design
>>
>> I will highlight several open problems along the way.
>>
>> *Bio: *Chandra Chekuri is the Paul and Cynthia Saylor Professor in the
>> Department of Computer Science at University of Illinois, Urbana-Champaign.
>> He joined the university in 2006 after spending eight years at Lucent Bell
>> Labs. Prior to that he received his PhD from Stanford University and an
>> undergraduate degree from IIT Chennai. He is interested in the design and
>> analysis of algorithms, combinatorial optimization, mathematical
>> programming, and theoretical computer science. His technical contributions
>> have been mainly on (fast) approximation algorithms, graphs and networks,
>> scheduling, and submodular optimization.
>>
>> *Host:* *Avrim Blum* <avrim at ttic.edu>
>>
>>
>> Mary C. Marre
>> Faculty Administrative Support
>> *Toyota Technological Institute*
>> *6045 S. Kenwood Avenue, Rm 517*
>> *Chicago, IL  60637*
>> *773-834-1757*
>> *mmarre at ttic.edu <mmarre at ttic.edu>*
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/theory/attachments/20240130/5b02af02/attachment-0001.html>