Abstract
It is known that online knapsack is not competitive. This negative result remains true even if the items are removable. In this paper we consider online removable knapsack with resource augmentation, in which we hold a knapsack of capacity R ≥ 1.0 and aim at maintaining a feasible packing to maximize the total weight of the items packed. Accepted items can be removed to leave room for newly arriving items. Once an item is rejected/removed it can not be considered again. We evaluate an online algorithm by comparing the resulting packing to an optimal packing that uses a knapsack of capacity one. Optimal online algorithms are derived for both the weighted case (items have arbitrary weights) and the un-weighted case (the weight of an item is equal to its size).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Csirik, J., Woeginger, G.J.: Resource augmentation for online bounded space bin packing. Journal of Algorithms archive 44, 308–320 (2002)
Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 293–305. Springer, Heidelberg (2002)
Iwama, K., Zhang, G.: Removable online knapsack - weighted case. In: Proceedings of the 7th Japan-Korea Workshop on Algorithms and Computation (WAAC), pp. 223–227 (2003)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47, 214–221 (1995)
Lueker, G.S.: Average-case analysis of off-line and on-line knapsack problems. In: Proceedings of the Sixth Annual ACM-SIAM SODA, pp.179–188 (1995)
Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Prog. 68, 73–104 (1995)
Noga, J., Sarbua, V.: An online partially fractional knapsack problems. In: Proceedings ISPAN 2005, pp. 108–112 (2005)
Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of STOC 1997, pp. 140–149 (1997)
Sleator, D., Tarjan, R.: Amortized effciency of list update and paging rules. Comm. ACM 23, 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwama, K., Zhang, G. (2007). Optimal Resource Augmentations for Online Knapsack. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2007 2007. Lecture Notes in Computer Science, vol 4627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74208-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-74208-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74207-4
Online ISBN: 978-3-540-74208-1
eBook Packages: Computer ScienceComputer Science (R0)