Funder
Natur og Univers, Det Frie Forskningsråd
Villum Fonden
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference38 articles.
1. Angelopoulos, S., Dürr, C., Jin, S.: Online maximum matching with recourse. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), Leibniz International Proceedings in Informatics (LIPIcs), vol. 117, pp. 8:1–8:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (2018)
2. Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In: 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 531–540. ACM (1996)
3. Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrbčík, M., Larsen., K.S.: Online dominating set. Algorithmica 81(5), 1938–1964 (2019)
4. Boyar, J., Favrholdt, L.M., Kotrbčík, M., Larsen., K.S.: Relaxing the irrevocability requirement for online graph algorithms. In: 15th International Algorithms and Data Structures Symposium (WADS), Lecture Notes in Computer Science, vol. 10389, pp. 217–228. Springer (2017)
5. Boyar, J., Larsen, K.S., Maiti, A.: The frequent items problem in online streaming under various performance measures. Int. J. Found. Comput. Sci. 26(4), 413–439 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Dominating Set and Coloring;Combinatorial Optimization and Applications;2023-12-09
2. Online Knapsack with Removal and Recourse;Lecture Notes in Computer Science;2023
3. The Power of Amortized Recourse for Online Graph Problems;Approximation and Online Algorithms;2022