SIGACT News Online Algorithms Column 38

Felix Hohne; Soren Schmitt; Rob van Stee

doi:10.1145/3510382.3510396

SIGACT News Online Algorithms Column 38

ACM SIGACT News ◽

10.1145/3510382.3510396 ◽

2021 ◽

Vol 52 (4) ◽

pp. 80-96

Author(s):

Felix Hohne ◽

Soren Schmitt ◽

Rob van Stee

Keyword(s):

Online Algorithms ◽

Complete Coverage ◽

News Online

In this column, we will discuss some papers in online algorithms that appeared in 2021. As usual, we make no claim at complete coverage here, and have instead made a selection. If we 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 us!

Download Full-text

SIGACT News Online Algorithms Column 36

ACM SIGACT News ◽

10.1145/3444815.3444830 ◽

2021 ◽

Vol 51 (4) ◽

pp. 89-107

Author(s):

Felix Höhne ◽

Sören Schmitt ◽

Rob van Stee

Keyword(s):

Online Algorithms ◽

Complete Coverage ◽

News Online

In this column, we will discuss some papers in online algorithms that appeared in 2020. As usual, we make no claim at complete coverage here, and have instead made a selection. If we 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 us!

Download Full-text

SIGACT News Online Algorithms Column 37

ACM SIGACT News ◽

10.1145/3471469.3471480 ◽

2021 ◽

Vol 52 (2) ◽

pp. 71-71

Author(s):

Rob van Stee

Keyword(s):

Lower Bound ◽

Online Algorithms ◽

Packet Scheduling ◽

Open Problems ◽

Competitive Algorithm ◽

Long Time ◽

News Online

For this issue, Pavel Vesely has contributed a wonderful overview of the ideas that were used in his SODA paper on packet scheduling with Marek Chrobak, Lukasz Jez and Jiri Sgall. This is a problem for which a 2-competitive algorithm as well as a lower bound of ϕ ≈ 1:618 was known already twenty years ago, but which resisted resolution for a long time. It is great that this problem has nally been resolved and that Pavel was willing to explain more of the ideas behind it for this column. He also provides an overview of open problems in this area.

Download Full-text