2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
A simpler QPTAS for scheduling jobs with precedence constraints
Syamantak Das, Andreas Wiese
We study the classical scheduling problem of minimizing the makespan of a set of unit size jobs with precedence constraints on parallel identical machines. Research on the problem…
cs.DS2014
Rejecting Jobs to Minimize Load and Maximum Flow-time
Anamitra Roy Choudhury, Syamantak Das, Naveen Garg +1
Online algorithms are usually analyzed using the notion of competitive ratio which compares the solution obtained by the algorithm to that obtained by an online adversary for the w…