Journal ArticleOPEN ACCESS

Online algorithms for a dual version of bin packing

Discrete Applied Mathematics (1988) 21(2) 163-167
DOI: 10.1016/0166-218X(88)90052-2
51Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is shown that for the dual version of bin packing defined by Assmann et al. no online algorithm can have a performance ratio better than 1 2. For uniformly distributed elements we give an asymptotically optimal algorithm. © 1988.

Cite

CITATION STYLE

APA

Csirik, J., & Totik, V. (1988). Online algorithms for a dual version of bin packing. Discrete Applied Mathematics, 21(2), 163–167. https://doi.org/10.1016/0166-218X(88)90052-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free