z-logo
open-access-imgOpen Access
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty
Author(s) -
Marin Bougeret,
György Dósa,
Noam Goldberg,
Michael Poss
Publication year - 2022
Publication title -
siam journal on discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.843
H-Index - 66
eISSN - 1095-7146
pISSN - 0895-4801
DOI - 10.1137/21m1457199
Subject(s) - bin packing problem , approximation algorithm , omega , bin , mathematics , constant (computer programming) , set (abstract data type) , time complexity , combinatorics , polynomial time approximation scheme , algorithm , physics , computer science , quantum mechanics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom