33 citations · 104 across the 16 of their papers we have counts for
1 paper · 1 filter
Marcin Mucha, Karol Węgrzycki, Michał Włodarczyk
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\vareps…