Skip to main content
SpringerLink
Log in

Online algorithms with advice for the dual bin packing problem

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

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< \varepsilon < 1{/}2\), an online algorithm with advice that is \((1/(1-\varepsilon ))\)-competitive and uses \({O}(1/\varepsilon )\) bits of advice per request is presented.

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

Similar content being viewed by others

References

  • Adamaszek A, Renault MP, Rosén A, van Stee R (2013) Reordering buffer management with advice. In: Approximation and Online Algorithms—11th International Workshop, WAOA 2013, Sophia Antipolis, France, 5–6 September, 2013, Revised Selected Papers, pp 132–143

  • Albers S, Hellwig M (2014) Online makespan minimization with parallel schedules. In: Algorithm Theory—SWAT 2014—14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, 2–4 July, 2014. Proceedings, pp 13–25

  • Angelopoulos S, Dürr C, Kamali S, Renault MP, Rosén A (2015) Online bin packing with advice of small size. In: Algorithms and Data Structures—14th International Symposium, WADS 2015, Victoria, BC, Canada, 5–7 August, 2015. Proceedings, pp 40–53

  • Azar Y, Boyar J, Epstein L, Favrholdt LM, Larsen KS, Nielsen MN (2002) Fair versus unrestricted bin packing. Algorithmica 34(2):181–196

    Article  Google Scholar 

  • Böckenhauer H, Komm D, Královic R, Rossmanith P (2014) The online knapsack problem: advice and randomization. Theor Comput Sci 527:61–72

    Article  Google Scholar 

  • Böckenhauer HJ, Komm D, Královic R, Královic R, Mömke T (2009) On the advice complexity of online problems. In: ISAAC, pp 331–340

  • Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, New York

    Google Scholar 

  • Boyar J, Kamali S, Larsen KS, López-Ortiz A (2016) Online bin packing with advice. Algorithmica 74(1):507–527

    Article  Google Scholar 

  • Boyar J, Larsen KS, Nielsen MN (2001) The accommodating function: a generalization of the competitive ratio. SIAM J Comput 31(1):233–258

    Article  Google Scholar 

  • Coffman EG, Leung JYT, Ting DW (1978) Bin packing: maximizing the number of pieces packed. Acta Inf 9:263–271

    Article  Google Scholar 

  • Cygan M, Jez L, Sgall J (2016) Online knapsack revisited. Theory Comput Syst 58(1):153–190

    Article  Google Scholar 

  • Dorrigiv R, He M, Zeh N (2012) On the advice complexity of buffer management. In: ISAAC, pp 136–145

  • Dorrigiv R, López-Ortiz A (2005) A survey of performance measures for on-line algorithms. SIGACT News 36(3):67–81

    Article  Google Scholar 

  • Emek Y, Fraigniaud P, Korman A, Rosén A (2011) Online computation with advice. Theor Comput Sci 412(24):2642–2656

    Article  Google Scholar 

  • Epstein L, Favrholdt LM (2003) On-line maximizing the number of items packed in variable-sized bins. Acta Cybern 16(1):57–66

    Google Scholar 

  • Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1–1/e. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’09IEEE Computer Society, Washington, DC, USA, pp 117–126

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York

  • Grove EF (1995) Online bin packing with lookahead. Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, SODA ’95 Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 430–436

  • Johnson D (1973) Near-optimal bin packing algorithms. Ph.D. thesis, MIT

  • Kellerer H (1999) A polynomial time approximation scheme for the multiple knapsack problem. In: RANDOM-APPROX, pp 51–62

  • Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21(5):235–242

    Article  Google Scholar 

  • Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin

    Book  Google Scholar 

  • Mahdian M, Yan Q (2011) Online bipartite matching with random arrivals: An approach based on strongly factor-revealing lps. Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC ’11ACM, New York, NY, USA, pp 597–606

  • Renault MP, Rosén A (2015) On online algorithms with advice for the k-server problem. Theory Comput Syst 56(1):3–21

    Article  Google Scholar 

  • Renault MP, Rosén A, van Stee R (2015) Online algorithms with advice for bin packing and scheduling problems. Theor Comput Sci 600:155–170

    Article  Google Scholar 

Download references

Acknowledgments

I would like to thank Reza Dorrigiv for suggesting this as an interesting problem to study. Also, I would like to thank Reza Dorrigiv and Norbert Zeh for useful preliminary discussions and Adi Rosén for helpful comments.

Author information

Authors and Affiliations

  1. CNRS and Université Paris Diderot, Paris, France

    Marc P. Renault

Authors
  1. Marc P. Renault
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marc P. Renault.

Additional information

Research supported in part by ANR project NeTOC (ANR-11-BS02-0015).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Renault, M.P. Online algorithms with advice for the dual bin packing problem. Cent Eur J Oper Res 25, 953–966 (2017). https://doi.org/10.1007/s10100-016-0450-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-016-0450-y

Keywords

Search

Navigation