398 citations
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2003★ 15 cited
Hybrid Rounding Techniques for Knapsack Problems
Monaldo Mastrolilli, Marcus Hutter
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of rou…
cs.CC2002
The Fastest and Shortest Algorithm for All Well-Defined Problems
Marcus Hutter
An algorithm is described that solves any well-defined problem as quickly as the fastest algorithm computing a solution to , save for a factor of 5 and low-order additiv…