3 citations · 4 across the 2 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2011★ 3 cited
Packing, Scheduling and Covering Problems in a Game-Theoretic Perspective
Elena Kleiman
Many packing, scheduling and covering problems that were previously considered by computer science literature in the context of various transportation and production problems, appe…
cs.GT2009★ 1 cited
Parametric packing of selfish items and the subset sum algorithm
Leah Epstein, Elena Kleiman, Julian Mestre
The subset sum algorithm is a natural heuristic for the classical Bin Packing problem: In each iteration, the algorithm finds among the unpacked items, a maximum size set of items…