16 citations · 69 across the 56 of their papers we have counts for
4 papers · 1 filter
Online Covering with Convex Objectives and Applications
Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi
We give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive onlin…
Tight Bounds for Online Vector Scheduling
Sungjin Im, Nathaniel Kell, Janardhan Kulkarni +1
Modern data centers face a key challenge of effectively serving user requests that arrive online. Such requests are inherently multi-dimensional and characterized by demand vectors…
Precedence-constrained Scheduling of Malleable Jobs with Preemption
Konstantin Makarychev, Debmalya Panigrahi
Scheduling jobs with precedence constraints on a set of identical machines to minimize the total processing time (makespan) is a fundamental problem in combinatorial optimization.…
Online Algorithms for Machine Minimization
Nikhil Devanur, Konstantin Makarychev, Debmalya Panigrahi +1
In this paper, we consider the online version of the machine minimization problem (introduced by Chuzhoy et al., FOCS 2004), where the goal is to schedule a set of jobs with releas…