BibTeX Export for First Fit bin packing: A tight analysis

Copy to Clipboard Download

@InProceedings{dosa_et_al:LIPIcs.STACS.2013.538,
  author =	{D\'{o}sa, Gy\"{o}rgy and Sgall, Jiri},
  title =	{{First Fit bin packing: A tight analysis}},
  booktitle =	{30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
  pages =	{538--549},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-50-7},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{20},
  editor =	{Portier, Natacha and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.538},
  URN =		{urn:nbn:de:0030-drops-39630},
  doi =		{10.4230/LIPIcs.STACS.2013.538},
  annote =	{Keywords: Approximation algorithms, online algorithms, bin packing, First Fit}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode