84 citations · 241 across the 22 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022
EPTAS for the dual of splittable bin packing with cardinality constraint
G. Jaykrishnan, Asaf Levin
The problem considered is the splittable bin packing with cardinality constraint. It is a variant of the bin packing problem where items are allowed to be split into parts but the…
cs.DS2022
The near exact bin covering problem
Asaf Levin
We present a new generalization of the bin covering problem that is known to be a strongly NP-hard problem. In our generalization there is a positive constant , and we are given…
cs.DS2022
Cardinality Constrained Scheduling in Online Models
Leah Epstein, Alexandra Lassota, Asaf Levin +2
Makespan minimization on parallel identical machines is a classical and intensively studied problem in scheduling, and a classic example for online algorithm analysis with Graham's…