10 citations · 13 across the 5 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.DS2006
Improved results for a memory allocation problem
Leah Epstein, Rob van Stee
We consider a memory allocation problem that can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. A 3/2-appro…
cs.GT2006
Covering selfish machines
Leah Epstein, Rob van Stee
We consider the machine covering problem for selfish related machines. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with run…