共 18 条
- [2] [Anonymous], 2019, P 2019 ANN ACM SIAM, DOI DOI 10.1137/1.9781611975482.8
- [3] Antoniadis Antonios, 2016, LATIN 2016: Theoretical Informatics. 12th Latin American Symposium. Proceedings: LNCS 9644, P68, DOI 10.1007/978-3-662-49529-2_6
- [4] Bansal N, 2018, SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1253
- [5] Benyamini Yoav, 2000, AM MATH SOC, V48
- [6] AN OPTIMAL ONLINE ALGORITHM FOR METRICAL TASK SYSTEM [J]. JOURNAL OF THE ACM, 1992, 39 (04) : 745 - 763
- [7] Competitively Chasing Convex Bodies [J]. PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 861 - 868
- [8] Chen N., 2018, P MACHINE LEARNING R, V75, P1574
- [10] Online chasing problems for regular polygons [J]. INFORMATION PROCESSING LETTERS, 2008, 108 (03) : 155 - 159