Abstract
The studied problem consists in selecting a group of k entities out of n entities such that their diversity is maximized. Each entity is assumed to be characterized by a single numerical attribute. The diversity is measured by the total pairwise Euclidean or squared Euclidean distance. The problem appears in the formation of social or working groups. Under certain conditions, diversity is perceived as a positive factor influencing the group’s effectiveness. We propose simple \(O(n+k\log k)\) time algorithms to solve this problem for both the total Euclidean and squared Euclidean distances.
This is a preview of subscription content, log in via an institution to check access.
References
Aggarwal, A., Imai, H., Katoh, N., & Suri, S. (1991). Finding \(k\) points with minimum diameter and related problems. Journal of Algorithms, 12(1), 38–56.
Amirgaliyeva, Z., Mladenović, N., Todosijević, R., & Urošević, D. (2017). Solving the maximum min-sum dispersion by alternating formulations of two different problems. European Journal of Operational Research, 260, 444–459.
Aringhieri, R., Cordone, R., & Grosso, A. (2015). Construction and improvement algorithms for dispersion problems. European Journal of Operational Research, 242, 21–33.
Blum, M., Floyd, R. W., Pratt, V. R., Rivest, R. L., & Tarjan, R. E. (1973). Time bounds for selection. Journal of Computer and System Sciences, 7(4), 448–461.
Cevallos, A., Eisenbrand, F., & Morell, S. (2018) Diversity maximization in doubling metrics. In 29th International symposium on algorithms and computation (ISAAC 2018) (pp. 33:1-33:12). Article No. 33, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany.
Cevallos, A., Eisenbrand, F., & Zenklusen, R. (2016) Max-sum diversity via convex programming. In 32nd Annual Symposium on Computational Geometry (SoCG) (pp. 26:1–26:14), LIPIcs Vol. 51, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany.
De Vaan, M., Stark, D., & Vedres, B. (2015). Game changer: The topology of creativity. American Journal of Sociology, 120(4), 1144–1194.
Dutta, P., Jain, A., & Gupta, A. (2020). Performance analysis of non-banking finance companies using two-stage data envelopment analysis. Annals of Operations Research, 295(1), 91–116.
Epasto, A., Mirrokni, V., & Zadimoghaddam, M. (2019). Scalable Diversity Maximization via small-size composable core-sets. In The 31st ACM symposium on parallelism in algorithms and architectures (pp. 41–42). Phoenix, AZ, USA.
Eremeev, A.V., Kel’manov, A.V., Kovalyov, M.Y., & Pyatkin, A.V. (2019). Maximum diversity problem with squared Euclidean distance. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11548 LNCS, pp. 541–551.
Fernandes, C. R., & Polzer, J. T. (2015). Diversity in groups. In R. Scott & S. Kosslyn (Eds.), Emerging Trends in the Social and Behavioral Sciences. Berlin: John Wiley & Sons Inc. ISBN 978-1-118-90077-2.
Hopcroft, J., & Kannan, R. (2012). Computer Science Theory for the Information Age. CiteSeerX.
Ianovski, E. (2021). Electing a committee with dominance constraints. Annals of Operations Research, in press.
John, L., Gurumurthy, A., Soni, G., & Jain, V. (2019). Modelling the inter-relationship between factors affecting coordination in a humanitarian supply chain: A case of Chennai flood relief. Annals of Operations Research, 283(1–2), 1227–1258.
Khan, H., Saif-ur-Rehman, Qadus, A., Jan, S.U., & Aamir, A. (2022). Adoption of eco-friendly cars: mediated effects of attitude and moderation role of gender diversity across UAE market: Application of extended version of theory of planned behaivour. Annals of Operations Research, in press.
Lei, T. L., & Church, R. L. (2015). On the unified dispersion problem: Efficient formulations and exact algorithms. European Journal of Operational Research, 241, 622–630.
Martí, R., Gallego, M., & Duarte, A. (2010). A branch and bound algorithm for the maximum diversity problem. European Journal of Operational Research, 200, 36–44.
Moeini, M., Goerzen, D., & Wendt, O. (2018). A Local Search heuristic for solving the Maximum Dispersion Problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10751 LNAI, pp. 362–371.
Ravi, S. S., Rosenkrantz, D. J., & Tayi, G. K. (1994). Heuristic and special case algorithms for dispersion problems. Operations Research, 42(2), 299–310.
Ríos-Mercado, R. Z., & Bard, J. F. (2019). An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation. European Journal of Operational Research, 276, 259–271.
Schmidt, A. B. (2019). Managing portfolio diversity within the mean variance theory. Annals of Operations Research, 282(1–2), 315–329.
Tutunchi, G. K., & Fathi, Y. (2019). Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem. Computers and Operations Research, 101, 43–54.
Vedres, B., & Stark, D. (2010). Generative disruption in overlapping groups. American Journal of Sociology, 115(4), 1150–1190.
Wang, D. W., & Kuo, Y.-S. (1988). A study on two geometric location problems. Information Processing Letters, 28, 281–286.
Yasar Saglam, S., & Street, W. N. (2018). Distant diversity in dynamic class prediction. Annals of Operations Research, 263(1–2), 5–19.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kovalev, S., Chalamon, I. & Petani, F.J. Maximizing single attribute diversity in group selection. Ann Oper Res 320, 535–540 (2023). https://doi.org/10.1007/s10479-022-04764-7
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-022-04764-7