8 citations · 11 across the 5 of their papers we have counts for
5 papers
Stochastic Makespan Minimization in Structured Set Systems
Anupam Gupta, Amit Kumar, Viswanath Nagarajan +1
We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a.\ the makespan). In this framework, we have a set of …
Stochastic Load Balancing on Unrelated Machines
Anupam Gupta, Amit Kumar, Viswanath Nagarajan +1
We consider the problem of makespan minimization on unrelated machines when job sizes are stochastic. The goal is to find a fixed assignment of jobs to machines, to minimize the ex…
Approximating Max-Cut under Graph-MSO Constraints
Martin Koutecký, Jon Lee, Viswanath Nagarajan +1
We consider the max-cut and max--cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of…
Online Covering with Sum of -Norm Objectives
Viswanath Nagarajan, Xiangkun Shen
We consider fractional online covering problems with -norm objectives. The problem of interest is of the form where $f(x)=\sum_{e} c_e…
Max-Cut under Graph Constraints
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G and (ii) edge-weights on a complete undirected graph on the same vertex set. The o…