SIGACT News Online Algorithms Column 34-Reference-Cited by-同舟云学术

SIGACT News Online Algorithms Column 34

Published:2018-12-15 Issue:4 Volume:49 Page:36-45
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

van Stee Rob¹

Affiliation:

1. University of Siegen, Siegen, Germany

Abstract

In this column, I will discuss some papers in online algorithms that appeared in 2018. It is very nice to see many good papers on this topic appearing year after year. I make no claim at complete coverage here, and have instead made a selection. As always, if I have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact me!

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3300150.3300160

Reference45 articles.

1. Susanne Albers and Matthias Hellwig . On the value of job migration in online makespan minimization. In Leah Epstein and Paolo Ferragina editors Algorithms - ESA 2012 - 20th Annual European Symposium Ljubljana Slovenia September 10--12 2012 . Proceedings volume 7501 of Lecture Notes in Computer Science pages 84{ 95 . Springer 2012. 10.1007/978-3-642-33090-2_9 Susanne Albers and Matthias Hellwig. On the value of job migration in online makespan minimization. In Leah Epstein and Paolo Ferragina editors Algorithms - ESA 2012 - 20th Annual European Symposium Ljubljana Slovenia September 10--12 2012. Proceedings volume 7501 of Lecture Notes in Computer Science pages 84{95. Springer 2012. 10.1007/978-3-642-33090-2_9

2. Tight bounds for online vector bin packing

3. Yossi Azar and Noam Touitou. Improved online algorithm for weighted ow time. CoRR abs/1712.10273 2017. Yossi Azar and Noam Touitou. Improved online algorithm for weighted ow time. CoRR abs/1712.10273 2017.