Publisher
Springer Nature Switzerland
Reference34 articles.
1. Bakken, O.R.: Arrangement problems parameterized by neighbourhood diversity. Master’s thesis, The University of Bergen (2018)
2. Bansal, N., Batra, J., Farhadi, M., Tetali, P.: Improved approximations for min sum vertex cover and generalized min sum set cover. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 998–1005 (2021)
3. Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140(2), 183–202 (1998)
4. Barenholz, U., Feige, U., Peleg, D., et al.: Improved approximation for min-sum vertex cover. 81, 06–07 (2006). http://wisdomarchive.wisdom.weizmann.ac.il
5. Basiak, M., Bienkowski, M., Tatarczuk, A.: An improved deterministic algorithm for the online min-sum set cover problem. arXiv preprint arXiv:2306.17755 (2023)