1. Awerbuch B, Azar Y, Fiat A, Leonardi S, Rosén A (1996) On-line competive algorithms for call admission in optical networks. In: Proceedings of the 4th annual European symposium on algorithms (ESA), LNCS, vol 1136, pp 431–444
2. Babaioff M, Immorlica N, Kempe D (2007) A knapsack secretary problem with applications. In: Proceedings of the 10th international workshop on approximation algorithms for combinatorial optimization (APPROX), pp 16–28
3. Bienstock D, Sethuraman J, Ye C (2013) Approximation algorithms for the incremental knapsack problem via disjunctive programming. arXiv.1311.4563
4. Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
5. Disser Y, Klimm M, Megow N, Stiller S (2014) Packing a knapsack of unknown capacity. In: Proceedings of the 31st international symposium on theoretical aspects of computer science (STACS), pp 276–287