Author:
Kamali Shahin,Nikbakht Pooya
Publisher
Springer International Publishing
Reference32 articles.
1. Abrahamsen, M., Miltzow, T., Seiferth, N.: Framework for $$exists$$r-completeness of two-dimensional packing problems. CoRR 2004.07558 (2020)
2. Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29(2), 459–473 (1999)
3. Albers, S., Hellwig, M.: Online makespan minimization with parallel schedules. Algorithmica 78(2), 492–520 (2017)
4. Allen, S.R., Iacono, J.: Packing identical simple polygons is NP-hard. CoRR abs/1209.5307 (2012)
5. Bansal, N., Correa, J.R., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions: inapproximability results and approximation schemes. Math. Oper. Res. 31(1), 31–49 (2006)