1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2009
Bin packing with general cost structures
Leah Epstein, Asaf Levin
Following the work of Anily et al., we consider a variant of bin packing, called "bin packing with general cost structures" (GCBP) and design an asymptotic fully polynomial time ap…
cs.DS2009★ 1 cited
Uniform unweighted set cover: The power of non-oblivious local search
Asaf Levin, Uri Yovel
We are given n base elements and a finite collection of subsets of them. The size of any subset varies between p to k (p < k). In addition, we assume that the input contains all po…