Online Algorithms – Viswanath Nagarajan

Online Covering with Sum of Lq-norm Objectives, with X.Shen,
ICALP, 2017.
Online Algorithms for Covering and Packing Problems with Convex Objectives, with Y. Azar, N. Buchbinder, H. Chan, S. Chen, IR. Cohen, A. Gupta, Z. Huang, N. Kang, J. Naor, D. Panigrahi.
FOCS 2016.
This is a merged version of three independent papers: 1, 2, 3.
Minimum Congestion Mapping in a Cloud, with N. Bansal, K.W. Lee and M. Zafer,
SIAM Journal on Computing, 44(3), 819-843, 2015.
Preliminary version in PODC 2011.
Hallucination Helps: Energy Efficient Virtual Circuit Routing,
with A. Antoniadis, S. Im, R. Krishnaswamy, B. Moseley, K. Pruhs and C. Stein,
SODA, 2014.
Approximating Sparse Covering Integer Programs Online, with A. Gupta,
Mathematics of Operations Research, 39(4): 998-1011, 2014.
Preliminary version in ICALP 2012.
Better Scalable Algorithms for Broadcast Scheduling, with N. Bansal and R. Krishnaswamy,
ACM Transactions on Algorithms 11(1):3, 2014.
Preliminary version in ICALP 2010.
Multicast Routing for Energy Minimization Using Speed Scaling,
with N. Bansal, A. Gupta, R. Krishnaswamy, K. Pruhs and C. Stein,
Mediterranean Conference on Algorithms, 2012.