2 citations · 9 across the 18 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
No Polynomial Kernels for Knapsack
Klaus Heeger, Danny Hermelin, Matthias Mnich +1
This paper focuses on kernelization algorithms for the fundamental Knapsack problem. A kernelization algorithm (or kernel) is a polynomial-time reduction from a problem onto itself…
cs.DS2023★ 2 cited
Threshold Testing and Semi-Online Prophet Inequalities
Martin Hoefer, Kevin Schewior
We study threshold testing, an elementary probing model with the goal to choose a large value out of i.i.d. random variables. An algorithm can test each variable once for…
cs.DS2023
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions
Klaus Heeger, André Nichterlein, Rolf Niedermeier
We provide a general framework to exclude parameterized running times of the form for problems that have polynomial running time lower bounds under hypotheses from…