1 citations · 1 across the 3 of their papers we have counts for
3 papers · 1 filter
Online Flow Time Minimization with Gradually Revealed Jobs
Alexander Lindermayr, Guido Schäfer, Jens Schlöter +1
We consider the problem of online preemptive scheduling on a single machine to minimize the total flow time. In clairvoyant scheduling, where job processing times are revealed upon…
When is String Reconstruction using de Bruijn Graphs Hard?
Ben Bals, Sebastiaan van Krieken, Solon P. Pissis +2
The reduction of the fragment assembly problem to (variations of) the classical Eulerian trail problem [Pevzner et al., PNAS 2001] has led to remarkable progress in genome assembly…
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
Thomas Bosman, Martijn van Ee, Yang Jiao +3
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the lit…