Author:
Angelopoulos Spyros,Dürr Christoph,Kamali Shahin,Renault Marc,Rosén Adi
Publisher
Springer International Publishing
Reference21 articles.
1. Lecture Notes in Computer Science;A Adamaszek,2014
2. Ásgeirsson, E.I., Ayesta, U., Coffman, E.G., Etra, J., Momcilovic, P., Phillips, D.J., Vokhshoori, V., Wang, Z., Wolfe, J.: Closed on-line bin packing. Acta Cybernetica 15(3), 361–367 (2002)
3. Balogh, J., Békési, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theoretical Computer Science 440–441, 1–13 (2012)
4. Böckenhauer, H., Hromkovic, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. Theoretical Computer Science 554, 95–108 (2014)
5. Böckenhauer, H., Komm, D., Královic, R., Rossmanith, P.: The online knapsack problem: Advice and randomization. Theoretical Computer Science 527, 61–72 (2014)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献