A lower bound for online rectangle packing - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Leah Epstein. A lower bound for online rectangle packing. J. Comb. Optim., 38(3):846-866, 2019. [doi]

@article{Epstein19-1,
  title = {A lower bound for online rectangle packing},
  author = {Leah Epstein},
  year = {2019},
  doi = {10.1007/s10878-019-00423-z},
  url = {https://doi.org/10.1007/s10878-019-00423-z},
  researchr = {https://researchr.org/publication/Epstein19-1},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {38},
  number = {3},
  pages = {846-866},
}

runs on WebDSL