Online algorithms with advice for the dual bin packing problem

Marc P. Renault ()
Additional contact information
Marc P. Renault: CNRS and Université Paris Diderot

Central European Journal of Operations Research, 2017, vol. 25, issue 4, No 12, 953-966

Abstract: Abstract This paper studies the problem of maximizing the number of items packed into n bins, known as the dual bin packing problem, in the advice per request model. In general, no online algorithm has a constant competitive ratio for this problem. An online algorithm with 1 bit of advice per request is shown to be 3/2-competitive. Next, for $$0

Keywords: Online algorithms; Online computation with advice; Competitive analysis; Dual bin packing; Multiple knapsack problem (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10100-016-0450-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:25:y:2017:i:4:d:10.1007_s10100-016-0450-y

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-016-0450-y

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().