M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys, A constant-factor approximation algorithm for the kmedian problem, ACM Symposium on Theory of Computing (STOC), pp.1-10, 1999.

M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, IEEE Foundations of Computer Science, pp.378-388, 1999.

L. Chen, H. Hassani, and A. Karbasi, Online Continuous Submodular Maximization, International Conference on Artificial Intelligence and Statistics, 2018.

G. Cornuejols, G. L. Nemhauser, and L. A. Wolsey, The uncapacitated facility location problem, Discrete Location Theory, pp.119-171

M. Cygan, A. Czumaj, M. Mucha, and P. Sankowski, Online Facility Location with Deletions, Annual European Symposium on Algorithms, 2018.

G. B. Dantzig, Discrete variable extremum problems, In Operations Research, vol.5, pp.266-277, 1957.

Y. Freund and R. E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences, vol.55, pp.119-139, 1997.

T. Fujita, K. Hatano, and . Takimoto, Combinatorial Online Prediction via Metarounding, Algorithmic Learning Theory, pp.68-82, 2013.

D. Golovin, A. Krause, and M. Streeter, Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments, 2014.

K. Jain and V. Vazirani, Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation, vol.48, pp.274-296, 2001.

A. Kalai and S. Vempala, Efficient algorithms for online decision problems, In Journal of Computer and System Sciences, vol.71, issue.3, pp.291-307, 2005.

S. Kakade, A. Kalai, and K. Ligett, Playing games with approximation algorithms, ACM Symposium on the Theory of Computing, pp.546-555, 2007.

W. M. Koolen, M. K. Warmuth, and J. Kivinen, Hedging structured concepts, Conference on Learning Theory, pp.239-254, 2010.

K. C. Kiwiel, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Math. Program, vol.112, pp.473-491, 2008.

A. Kumar, Constant factor approximation algorithm for the knapsack median problem, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.824-832, 2012.

E. Hazan and S. Kale, Online submodular minimization, Journal of Machine Learning Research (JMLR), 2012.

D. P. Helmbold and S. V. Vishwanathan, Online Learning of Combinatorial Objects via Extended Formulation, International Conference on Algorithmic Learning Theory, 2018.

N. Laoutaris, G. Smaragdakis, K. Oikonomou, I. Stavrakakis, and A. Bestavros, Distributed Placement of Service Facilities in Large-Scale Networks, IEEE INFOCOM, pp.2144-2152, 2007.

S. Martello and P. Toth, An upper bound for the zeroone knapsack problem and a branch and bound algorithm, In European Journal of Operational Research, vol.1, pp.169-175, 1977.

A. Meyerson, Online Facility Location, IEEE Symposium on Foundations of Computer Science, FOCS, 2001.

D. Shmoys, E. Tardos, and K. , Approximation algorithms for facility location problems, ACM Symposium on Theory of Computing (STOC 1997), pp.265-274, 1997.

M. Streeter and D. Golovin, An Online Algorithm for Maximizing Submodular Functions, Conference on Neural Information Processing Systems, 2008.

H. Yu, M. J. Neely, and X. Wei, Online Convex Optimization with Stochastic Constraints, Conference on Neural Information Processing Systems, 2017.

M. Zinkevich, Online convex programming and generalized infinitesimal gradient ascent, International Conference on Machine Learning, 2003.

S. Pasteris, S. Wang, M. Herbster, and T. He, Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems, 2019.