Funder
German-Israeli Foundation for Scientific Research and Development
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference25 articles.
1. Berndt, S., Dreismann, V., Grage, K., Jansen, K., Knof, I.: Robust online algorithms for certain dynamic packing problems. In Proceedings of the 17th International Workshop on Approximation and Online Algorithms, (WAOA 2019), pp. 43–59 (2019)
2. Berndt, S., Epstein, L., Jansen, K., Levin, A., Maack, M., Rohwedder, L.: Online bin covering with limited migration. In: Proceedings of the 27th Annual European Symposium on Algorithms, ESA 2019, vol. 144, pp. 18:1–18:14 (2019)
3. Berndt, S., Jansen, K., Klein, K.: Fully dynamic bin packing revisited. Math. Program. 179(1), 109–155 (2020)
4. Cook, W., Gerards, A., Schrijver, A., Tardos, É.: Sensitivity theorems in integer linear programming. Math. Program. 34(3), 251–264 (1986)
5. Epstein, L., Levin, A.: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. 109(1), 32–37 (2008)