Author:
Böckenhauer Hans-Joachim,Komm Dennis,Královič Rastislav,Královič Richard,Mömke Tobias
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Ben-David, S., Borodin, A.: A new measure for the study of on-line algorithms. Algorithmica 11(1), 73–91 (1994)
2. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)
3. Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: Online Algorithms with Advice. Technical Report 614. ETH Zurich, Department of Computer Science (2009)
4. Brucker, P.: An efficient algorithm for the job-shop problem with two jobs. Computing 40(4), 353–359 (1988)
5. Caragiannis, I., Fishkin, A.V., Kaklamanis, C., Papaioannou, E.: Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. Discrete Applied Mathematics 155(2), 119–136 (2007)
Cited by
93 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online computation with untrusted advice;Journal of Computer and System Sciences;2024-09
2. Online demand peak shaving with machine‐learned advice in digital twins;Digital Twins and Applications;2024-09
3. The Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems;2024
4. Online Demand Peak Shaving with Machine-Learned Advice in Cyber-Physical Energy Systems;2023 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech);2023-11-14
5. Online Knapsack with Removal and Recourse;Lecture Notes in Computer Science;2023