We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...
Herman Geuvers, Adam Koprowski, Dan Synek, Eelis v...