Approximating robust bin packing with budgeted uncertainty

DOI10.1007/978-3-030-24766-9_6OpenAlexW2966706308MaRDI QIDQ2285083

Michael Poss, Noam Goldberg, Aniket Basu Roy, Marin Bougeret

Publication date: 16 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24766-9_6

zbMATH Keywords

dynamic programmingapproximation algorithmrobust optimizationbin-packingnext-fit

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items

Online makespan minimization with budgeted uncertainty, Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty, Approximation results for makespan minimization with budgeted uncertainty