25 citations · 57 across the 24 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DM2013
The Simplex Algorithm is NP-mighty
Yann Disser, Martin Skutella
We propose to classify the power of algorithms by the complexity of the problems that they can be used to solve. Instead of restricting to the problem a particular algorithm was de…
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…