Author:
Boyar Joan,Favrholdt Lene M.,Kotrbčík Michal,Larsen Kim S.
Publisher
Springer International Publishing
Reference26 articles.
1. Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In: 28th STOC, pp. 531–540. ACM (1996)
2. Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrbčík, M., Larsen, K.S.: Online dominating set. In: 15th SWAT, LIPIcs, vol. 53, pp. 21:1–21:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (2016)
3. Boyar, J., Favrholdt, L.M., Kotrbčík, M., Larsen, K.S.: Relaxing the irrevocability requirements for online graph algorithms. Technical Report arXiv:1704.08835 [cs.DS], arXiv (2017)
4. Cygan, M., Jeż, Ł., Sgall, J.: Online knapsack revisited. Theor. Comput. Syst. 58(1), 153–190 (2016)
5. Demange, M., Paschos, V.T.: On-line vertex-covering. Theor. Comput. Sci. 332, 83–108 (2005)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献