Author:
Böckenhauer Hans-Joachim,Hromkovič Juraj,Komm Dennis
Publisher
Springer International Publishing
Reference35 articles.
1. Lecture Notes in Computer Science;K Barhum,2014
2. Lecture Notes in Computer Science;K Barhum,2014
3. Lecture Notes in Computer Science;MP Bianchi,2012
4. Lecture Notes in Computer Science;MP Bianchi,2013
5. Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the
$$k$$
-server problem (extended abstract). In: Proc. of FOCS 2011, pp. 267–276 (2011)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Call admission problems on trees;Theoretical Computer Science;2022-06
2. Online Bin Covering with Advice;Algorithmica;2020-06-18
3. Online Bin Covering with Advice;Lecture Notes in Computer Science;2019
4. Online Algorithms with Advice;ACM Computing Surveys;2018-03-31
5. Online Algorithms with Advice: A Survey;ACM SIGACT News;2016-08-31