114 citations · 157 across the 12 of their papers we have counts for
Showing cs.CCShow all
3 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…
cs.CC2001
An effective Procedure for Speeding up Algorithms
Marcus Hutter
The provably asymptotically fastest algorithm within a factor of 5 for formally described problems will be constructed. The main idea is to enumerate all programs provably equivale…