University of Leicester
Browse
ft-proc2_2014_10_06.pdf (320.95 kB)

The optimal absolute ratio for online bin packing

Download (320.95 kB)
conference contribution
posted on 2015-06-01, 09:53 authored by Janos Balogh, Jozsef Békési, Gyorgy Dósa, Jiri Sgall, Rob van Stee
We present an online bin packing algorithm with absolute competitive ratio 5/3, which is optimal.

History

Citation

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, 2015, pp. 1425-1438

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA

Version

  • AM (Accepted Manuscript)

Published in

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms

Publisher

Society for Industrial and Applied Mathematics

isbn

978-1-61197-374-7;978-1-61197-373-0

Copyright date

2015

Available date

2015-06-01

Publisher version

http://epubs.siam.org/doi/10.1137/1.9781611973730.94

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC