1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024★ 1 cited
Approximation Algorithms for Combinatorial Optimization with Predictions
Antonios Antoniadis, Marek Eliáš, Adam Polak +1
We initiate a systematic study of utilizing predictions to improve over approximation guarantees of classic algorithms, without increasing the running time. We propose a systematic…
cs.DS2024
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
Karl Bringmann, Anita Dürr, Adam Polak
We present a pseudopolynomial-time algorithm for the Knapsack problem that has running time , where is the number of items, is the knap…