10 citations · 31 across the 24 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Packing a Knapsack of Unknown Capacity
Yann Disser, Max Klimm, Nicole Megow +1
We study the problem of packing a knapsack without knowing its capacity. Whenever we attempt to pack an item that does not fit, the item is discarded; if the item fits, we have to…
cs.DS2013★ 5 cited
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
Nicole Megow, Andreas Wiese
We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective of minimizing the makespan. For any number of identical parallel or uniformly rel…