David Fischer

most citedApproximation algorithms for coupled task scheduling minimizing the sum of completion times

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

1 paper · 1 filter

cs.DS2022

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling

David Fischer, Julian Golak, Matthias Mnich

We consider so-called $N$ -fold integer programs (IPs) of the form $max {c^{T} x : A x = b, ℓ \leq x \leq u, x \in Z^{n t}}, w h er e$ A \in \mathbb Z^{(r+sn)\times nt} consis…