Indian Institute of Technology, New Delhi
Amit Kumar is a Professor in the Department of Computer Science and Engineering at IIT Delhi. He holds a B.Tech. degree from IIT Kanpur and PhD from Cornell University. He was a member of technical staff at Bell Laboratories, Murray Hill during 2002–03, and has been a faculty member at IIT Delhi since 2003. His research lies in the area of combinatorial optimization, with emphasis on problems arising in scheduling, graph theory and clustering. He has received IBM Faculty Award (2005), INAE (Indian National Academy of Engineering) Young Engineer Award (2006) and INSA (Indian National Science Academy) Medal for Young Scientists (2011). He is a Fellow of Indian Academy of Sciences and has received the Shanti Swarup Bhatnagar Award for mathematical sciences (2018). Amit Kumar was elected Fellow in 2019.
SESSION 1B: Inaugural Lectures by Fellows/Associates
E D Jemmis
Online algorithms for packing and covering problems View Presentation
Online algorithms are used to model problems where the input is revealed over time and the algorithm needs to make irrevocable decisions. Packing and covering problems are a large class of combinatorial optimization problems. In this talk, the speaker will describe some recent models for these problems, which study the trade-off between the quality of the solution and the extent to which the notion of ‘irrevocability’ can be violated.