VOLUME 8 2003 NUMBER 4
Approximation Lower Bounds in Online LIB Bin Packing and Covering
Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser
Pages 663–674



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2003-663,
  author  = {Prabhu Manyem and Rhonda L. Salt and Marc Simon Visser},
  title   = {Approximation Lower Bounds in Online LIB Bin Packing and Covering},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {8},
  number  = {4},
  pages   = {663--674},
  year    = {2003},
  url     = {https://doi.org/10.25596/jalc-2003-663},
  doi     = {10.25596/jalc-2003-663}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: online approximation algorithm, asymptotic worst case ratio, bin packing problem, bin covering problem, longest item, uniform sized bins
DOI: 10.25596/jalc-2003-663