2025
Augmenting Online Algorithms for Knapsack Problem with Total Weight Information
AAAI 2025technical
In this paper, we augment online algorithms for the knapsack problem using the total weight information. The conventional optimal online algorithm achieves the ln(U/L)+1 competitive ratio where L and U are the upper and lower bounds of the value-to-weight ratio. However, it does not consider that de…