Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem