2 papers
cs.DS2026
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…
cs.DS2025
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…