메뉴 건너뛰기




Volumn 42, Issue 15, 1997, Pages 1262-1265

The proof of FFD(L)≤11/9OPT(L) + 7/9

Author keywords

Bin packing; FFD algorithm; Minimal counter example; Weigtht function

Indexed keywords


EID: 0642332429     PISSN: 10016538     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02882754     Document Type: Article
Times cited : (15)

References (2)
  • 1
    • 0002296629 scopus 로고
    • A new proof for the first-fit-decreasing bin-packing algorithm
    • Baker, B. S., A new proof for the first-fit-decreasing bin-packing algorithm, J. Algorithms, 1985, 6: 49.
    • (1985) J. Algorithms , vol.6 , pp. 49
    • Baker, B.S.1
  • 2
    • 0041636797 scopus 로고
    • A simple proof of the inequality FFD(L) ≤11/9OPT(L) + 1, ∀ L, for the FFD bin-packing algorithm
    • Yue Minyi, A simple proof of the inequality FFD(L) ≤11/9OPT(L) + 1, ∀ L, for the FFD bin-packing algorithm, Acta Mathematical Applicatae Sinica, 1991, 7(4): 321.
    • (1991) Acta Mathematical Applicatae Sinica , vol.7 , Issue.4 , pp. 321
    • Yue, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.