81 citations · 136 across the 38 of their papers we have counts for
Showing 2010 · cs.DMShow all
2 papers · 2 filters
cs.DM2010
Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps
Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß +1
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the…
cs.DM2010
Bin Packing via Discrepancy of Permutations
Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmark…