[39] Elad Hazan and Tomer Koren. The computational power of optimization in online learning. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing, STOC 2016, 2016.
[40] David P. Helmbold, Robert E. Schapire, and M. Long. Predicting nearly as well as the best pruning of a decision tree. In Machine Learning, 1997.
[41] David P. Helmbold and Manfred K. Warmuth. Learning permutations with exponential weights. In Proceedings of the 20th Annual Conference on Learning Theory, COLT 2007, 2007.
[42] Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, and Moshe Tennenholtz. Dueling algorithms. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC '11, page 215–224, New York, NY, USA, 2011. Association for Computing Machinery.
[43] Kamal Jain, Mohammad Mahdian, and Amin Saberi. A new greedy approach for facility location problems. In John H. Reif, editor, Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montreal, Quebec, Canada, pages 731-740. ACM, 2002.
[44] Kamal Jain and Vijay V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM, 48(2):274-296, 2001.
[45] Stefanie Jegelka and Jeff A. Bilmes. Online submodular minimization for combinatorial structures. In Proceedings of the 28th International Conference on Machine Learning, ICML 2011, 2011.
[46] Sham Kakade, Adam Tauman Kalai, and Katrina Ligett. Playing games with approximation algorithms. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC 2007, 2007.
[47] Adam Kalai and Santosh Vempala. Efficient algorithms for online decision problems. In J. Comput. Syst. Sci. Springer, 2003.
[48] Wouter M. Koolen, Manfred K. Warmuth, and Jyrki Kivinen. Hedging structured concepts. In the 23rd Conference on Learning Theory, COLT 2010, 2010.
[49] Elias Koutsoupias. The k-server problem. Comput. Sci. Rev., 3(2):105-118, 2009.
[50] Elias Koutsoupias and Christos H. Papadimitriou. On the k-server conjecture. J. ACM, 42(5):971-983, 1995.
[51] Amit Kumar. Constant factor approximation algorithm for the knapsack median problem. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, page 824–832. Society for Industrial and Applied Mathematics, 2012.
[52] Amit Kumar, Yogish Sabharwal, and Sandeep Sen. Linear-time approximation schemes for clustering problems in any dimensions. J. ACM, 57(2), 2010.
[53] Silvio Lattanzi and Sergei Vassilvitskii. Consistent k-clustering. In Doina Precup and Yee Whye Teh, editors, Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, volume 70 of Proceedings of Machine Learning Research, pages 1975-1984. PMLR, 2017.
[54] Shi Li and Ola Svensson. Approximating k-median via pseudo-approximation. SIAM J. Comput., 45(2):530-547, 2016.
[55] Jyh-Han Lin and Jeffrey Scott Vitter. Approximation algorithms for geometric median problems. Information Processing Letters, 44(5):245 - 249, 1992.
[56] M.E.J. Newman. The structure and function of complex networks. SIAM review, 45(2):167-256, 2003.
[57] Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic Spreading in Scale-Free Networks. Physical Review Letters, 86(14):3200-3203, 2001.