activity
20182024
most citedA Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

3 citations · 7 across the 10 of their papers we have counts for

collaborators
Showing 2023 · cs.DSShow all

1 paper · 2 filters

cs.DS2023★ 2 cited

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints

Jesper Nederlof, Céline M. F. Swennenhuis, Karol Węgrzycki

In a classical scheduling problem, we are given a set of jobs of unit length along with precedence constraints, and the goal is to find a schedule of these jobs on identica…