Skip to main content
SpringerLink
Log in

The proof of FFD(L) < -OPT(L) + 7/9

  • Bulletin
  • Published:
Chinese Science Bulletin

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Baker, B. S., A new proof for the first-fit-decreasing bin-packing algorithm,J. Algorithms, 1985, 6: 49.

    Article  Google Scholar 

  2. Yue Minyi, A simple proof of the inequality FFD(L) ≤ 11/9OPT(L) + 1, ∀L, for the FFD bin-packing algorithm,Acta Mathematicae Applicatae Sinica, 1991, 7(4): 321.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Hunan Normal University, 410081, Changsha, China

    Rongheng Li

  2. Institute of Applied Mathematics, Chinese Academy of Sciences, 100080, Reijing, China

    Minyi Yue

Authors
  1. Rongheng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minyi Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Li, R., Yue, M. The proof of FFD(L) < -OPT(L) + 7/9. Chin.Sci.Bull. 42, 1262–1265 (1997). https://doi.org/10.1007/BF02882754

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02882754

Keywords

Search

Navigation