The tight bound of First Fit Decreasing bin-packing algorithm is FFD(I) ≤ 11/9 OPT(I) + 6/9

Record

Authors
Dósa, G.
Year
2007
Title
The tight bound of First Fit Decreasing bin-packing algorithm is FFD(I) ≤ 11/9 OPT(I) + 6/9
Published in
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007)
Pages
1–11
Type
Book chapter
Our note
none yet
Verification
matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W1564665474 · DOI 10.1007/978-3-540-74450-4_1
Id
dosa-2007-tight-bound-first-fit-decreasing-bin

Cited on

As cited

The pages cite this work in one form.

  • Dósa, G. (2007). The tight bound of First Fit Decreasing bin-packing algorithm is FFD(I) ≤ 11/9 OPT(I) + 6/9. In Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Lecture Notes in Computer Science 4614, 1–11. Springer.

BibLaTeX

@incollection{dosa-2007-tight-bound-first-fit-decreasing-bin,
  author = {Dósa, G.},
  title = {{The tight bound of First Fit Decreasing bin-packing algorithm is FFD(I) ≤ 11/9 OPT(I) + 6/9}},
  booktitle = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007)},
  date = {2007},
  pages = {1--11}
}

Download · JSON with CSL-JSON · the whole bibliography