Funder
European Research Council
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Grantová Agentura Ceské Republiky
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. Andrew, L.H., Barman, S., Ligett, K., Lin, M., Meyerson, A., Roytman, A., Wierman, A.: A tale of two metrics: simultaneous bounds on competitiveness and regret. In: Proceedings of COLT 2013, pp. 741–763 (2013)
2. Andrew, L.H., Barman, S., Ligett, K., Lin, M., Meyerson, A., Roytman, A., Wierman, A.: A tale of two metrics: simultaneous bounds on competitiveness and regret. ArXiv e-prints, arXiv:1508.03769 (2015)
3. Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Schewior, K., Scquizzato, M.: Chasing convex bodies and functions.In: Proceedings of LATIN 2016, pp. 68–81 (2016)
4. Antoniadis, A., Schewior, K.: A tight lower bound for online convex optimization with switching costs. In: Proceedings of WAOA 2017, pp. 164–175 (2017)
5. Argue, C.J., Bubeck, S., Cohen, M.B., Gupta, A., Lee, Y.T.: A nearly-linear bound for chasing nested convex bodies. In: Proceedings of SODA 2019, pp. 117–122 (2019)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithms for Right-sizing Heterogeneous Data Centers;ACM Transactions on Parallel Computing;2023-12-14
2. Chasing Positive Bodies;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing;Discrete & Computational Geometry;2023-07-05