[1] S. Abbar, S. Amer-Yahia, P. Indyk, and S. Mahabadi. Real-Time Recommendation of Diverse Related Articles. In Proceedings of the 22nd International Conference on World Wide Web (WWW'13), pages 1-12, 2013.
[2] S. Abbar, S. Amer-Yahia, P. Indyk, S. Mahabadi, and K. R. Varadarajan. Diverse Near Neighbor Problem. In Proceedings of the twenty-ninth annual Symposium on Computational Geometry (SoCG'13), pages 207-214, 2013.
[3] Z. Abbassi, V. S. Mirrokni, and M. Thakur. Diversity Maximization Under Matroid Constraints. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pages 32-40, 2013.
[4] R. Addanki, A. McGregorl, A. Meliou, and Z. Moumoulidou. Improved Approximation and Scalability for Fair Max-Min Diversification. arXiv preprint arXiv:2201.06678, 2022.
[5] A. Angel and N. Koudas. Efficient Diversity-Aware Search. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pages 781-792, 2011.
[6] A. Bhaskara, M. Ghadiri, V. Mirrokni, and O. Svensson. Linear Relaxations for Finding Diverse Elements in Metric Spaces. Advances in Neural Information Processing Systems (NIPS'16), 29, 2016.
[7] A. Borodin, H. C. Lee, and Y. Ye. Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates. In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, pages 155-166, 2012.
[8] M. Ceccarello, A. Pietracaprina, and G. Pucci. Fast Coreset-based Diversity Maximization under Matroid Constraints. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pages 81-89, 2018.
[9] M. Ceccarello, A. Pietracaprina, and G. Pucci. A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. ACM Transactions on Knowledge Discovery from Data (TKDD), 14(5):1-27, 2020.
[10] E. Celis, V. Keswani, D. Straszak, A. Deshpande, T. Kathuria, and N. Vishnoi. Fair and Diverse DPP-Based Data Summarization. In International Conference on Machine Learning (ICML'18), pages 716-725. PMLR, 2018.
[11] B. Chandra and M. M. Halldórsson. Approximation Algullrithms for Dispersion Problems. Journal of Algullrithms, 38(2):438-465, 2001.
[12] J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), Minneapolis, Minnesota, June 2019. Association for Computational Linguistics.
[13] M. Drosou and E. Pitoura. Search Result Diversification. ACM SIGMOD Record, 39(1):41-47, 2010.
[14] S. Gollapudi, S. Mahabadi, and V. Sivashankar. Composable coresets for determinant maximization: Greedy is almost optimal. In Advances in Neural Information Processing Systems (NeurIPS), 2023.
[15] S. Gollapudi and A. Sharma. An Axiomatic Approach for Result Diversification. In Proceedings of the 18th International Conference on World Wide Web (WWW'09), pages 381-390, 2009.
[16] B. Gong, W.-L. Chao, K. Grauman, and F. Sha. Diverse Sequential Subset Selection for Supervised Video Summarization. In Advances in Neural Information Processing Systems 27 (NIPS 2014), 27, 2014.
[17] T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science (TCS), 38:293-306, 1985.