Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference25 articles.
1. 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
2. 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
3. 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
4. Azar Y, Boyar J, Epstein L, Favrholdt LM, Larsen KS, Nielsen MN (2002) Fair versus unrestricted bin packing. Algorithmica 34(2):181–196
5. Böckenhauer H, Komm D, Královic R, Rossmanith P (2014) The online knapsack problem: advice and randomization. Theor Comput Sci 527:61–72
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Bin Covering with Advice;Algorithmica;2020-06-18
2. Online Bin Covering with Advice;Lecture Notes in Computer Science;2019
3. Online Algorithms with Advice;ACM Computing Surveys;2018-03-31
4. Editorial;Central European Journal of Operations Research;2017-06-20