81 citations · 310 across the 59 of their papers we have counts for
3 papers · 1 filter
A Local Search-Based Approach for Set Covering
Anupam Gupta, Euiwoong Lee, Jason Li
In the Set Cover problem, we are given a set system with each set having a weight, and we want to find a collection of sets that cover the universe, whilst having low total weight.…
Configuration Balancing for Stochastic Requests
Franziska Eberle, Anupam Gupta, Nicole Megow +2
The configuration balancing problem with stochastic requests generalizes many well-studied resource allocation problems such as load balancing and virtual circuit routing. In it, w…
Minimizing Completion Times for Stochastic Jobs via Batched Free Times
Anupam Gupta, Benjamin Moseley, Rudy Zhou
We study the classic problem of minimizing the expected total completion time of jobs on identical machines in the setting where the sizes of the jobs are stochastic. Specifica…