Author:
Boyar Joan,Favrholdt Lene M.,Kudahl Christian,Mikkelsen Jesper W.
Funder
Villum Fonden (DK)
Det Frie Forskningsråd (DK)
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference32 articles.
1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM J. Comput. 39 (2), 361–370 (2009).
2. Barhum, K.: Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem. Proceedings of the 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Lecture Notes in Computer Science. Springer, 77–88 (2014).
3. Barhum, K., Böckenhauer, H.J., Forišek, M., Gebauer, H., Hromkovič, J., Krug, S., Smula, J., Steffen, B.: On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. In Proceedings of the 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Lecture Notes in Computer Science. Springer, 89–101 (2014).
4. Bianchi, M.P., Böckenhauer, H.J., Hromkovič, J., Keller, L.: Online coloring of bipartite graphs with and without advice. Algorithmica. 70 (1), 92–111 (2014).
5. Böckenhauer, H.J., Hromkovič, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554, 95–108 (2014).
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献