Affiliation:
1. Computer Science Institute of Charles University, Prague, Czech Rep
Abstract
Online packet scheduling with deadlines is one of the fundamental models in buffer management. Recently, the author together with Chrobak, Jez, and Sgall (SODA 2019) designed an optimal ϕ-competitive algorithm for this problem, where ϕ ≈1.618 is the golden ratio. In this column, we sketch ideas that led us to the development of this algorithm and outline the concepts in its analysis. We also highlight open questions in packet scheduling.
Publisher
Association for Computing Machinery (ACM)
Reference24 articles.
1. Online packet scheduling with bounded delay and lookahead;B¨ohm Martin;Theoretical Computer Science,2019
2. A-competitive algorithm for collecting items with increasing weights from a dynamic queue;Bie´nkowski Marcin;Theoretical Computer Science,2013
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献