Author:
Batra Jatin,Das Syamantak,Jha Agastya Vibhuti
Publisher
Springer Nature Switzerland
Reference19 articles.
1. Aouad, A., Segev, D.: The ordered k-median problem: surrogate models and approximation algorithms. Math. Program. 177(4), 55–83 (2019)
2. Ageev, A.A., Sviridenko, M.I.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8, 307–328 (2004)
3. Bansal, N., Batra, J., Farhadi, M., Tetali, P.: Improved approximations for min sum vertex cover and generalized min sum set cover. In: SODA 2021, pp. 986–1005. Society for Industrial and Applied Mathematics (2021)
4. Braverman, V., Jiang, S.H.-C., Krauthgamer, R., Wu, X.: Coresets for ordered weighted clustering. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 744–753. PMLR (2019)
5. Byrka, J., Sornat, K., Spoerhase, J.: Constant-factor approximation for ordered k-median. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, New York, NY, USA, pp. 620–631. Association for Computing Machinery (2018). https://doi.org/10.1145/3188745.3188930