Now showing items 1-1 of 1

    • Das, Syamantak; Wiese, Andreas (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      We study the classical scheduling problem of assigning jobs to machines in order to minimize the makespan. It is well-studied and admits an EPTAS on identical machines and a (2 − 1/m)- approximation algorithm on unrelated ...