{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:51Z","timestamp":1740123891463,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7-9","license":[{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10472-021-09773-z","type":"journal-article","created":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T22:05:04Z","timestamp":1632348304000},"page":"965-977","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Selecting a subset of diverse points based on the squared euclidean distance"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-7874","authenticated-orcid":false,"given":"Anton V.","family":"Eremeev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander V.","family":"Kel\u2019manov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artem V.","family":"Pyatkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"1","key":"9773_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"H Aggarwal","year":"1991","unstructured":"Aggarwal, H., Imai, N., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Alg. 12(1), 38\u201356 (1991)","journal-title":"J. Alg."},{"issue":"3","key":"9773_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10100-009-0093-3","volume":"17","author":"R Aringhieri","year":"2009","unstructured":"Aringhieri, R.: Composing medical crews with equity and efficiency. Cent. Eur. J. Oper. Res. 17(3), 343\u2013357 (2009)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"9773_CR3","unstructured":"Castillo, C., Segura, J.C.: Differential evolution with enhanced diversity maintenance. Optim. Lett (2019)"},{"key":"9773_CR4","unstructured":"Cevallos, A., Eisenbrand, F., andMorell, S.: Diversity maximization in doubling metrics. In: Proc. of 29th International symposium on algorithms and computation (ISAAC 2018), LIPIcs Vol. 123, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 33:1\u201333:12 (2016)"},{"key":"9773_CR5","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-sum diversity via convex programming. In: 32nd Annual Symposium on Computational Geometry (SoCG), LIPIcs Vol. 51, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 26:1\u201326:14 (2016)"},{"key":"9773_CR6","doi-asserted-by":"crossref","unstructured":"Eremeev, A.V., Kel\u2019manov, A.V., Kovalyov, M.Y., Pyatkin, A.V.: Maximum diversity problem with squared Euclidean distance. In: Khachay, M., Kochetov, Y., Pardalos, P (eds.) Proc. of International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019, Yekaterinburg, Russia, July 8-12, 2019. Lecture Notes in Computer Science, vol. 11548, pp 541\u2013551. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-22629-9_38"},{"key":"9773_CR7","doi-asserted-by":"crossref","unstructured":"Eremeev, A.V., Kovalyov, M.Y., Pyatkin, A.V.: On finding minimum cardinality subset of vectors with a constraint on the sum of squared Euclidean pairwise distances. In: Kotsireas, I., Pardalos, P (eds.) Learning and Intelligent Optimization. LION 2020. Lecture Notes in Computer Science, vol. 12096, pp 40\u201345. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-53552-0_6"},{"key":"9773_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.2307\/2528096","volume":"21","author":"AWF Edwards","year":"1965","unstructured":"Edwards, A.W.F., Cavalli-Sforza, L.L.: A method for cluster analysis. Biometrics 21, 362\u2013375 (1965)","journal-title":"Biometrics"},{"key":"9773_CR9","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness . W.H. Freeman and Company, San Francisco (1979)"},{"key":"9773_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O Ibarra","year":"1975","unstructured":"Ibarra, O., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22, 463\u2013468 (1975)","journal-title":"J. ACM"},{"issue":"3","key":"9773_CR11","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1134\/S1990478911030069","volume":"5","author":"AV Kel\u2019manov","year":"2011","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: NP-completeness of some problems of choosing a vector subset. J. Appl. Ind. Math. 5(3), 352\u2013357 (2011)","journal-title":"J. Appl. Ind. Math."},{"issue":"2","key":"9773_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1134\/S0005117912020129","volume":"73","author":"AV Kel\u2019manov","year":"2012","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M.: Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems. Autom. Remote. Control. 73(2), 349\u2013354 (2012)","journal-title":"Autom. Remote. Control."},{"issue":"3","key":"9773_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1134\/S1990478914030041","volume":"8","author":"AV Kel\u2019manov","year":"2014","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M.: An FPTAS for a vector subset search problem. J. Appl. Ind. Math. 8(3), 329\u2013336 (2014)","journal-title":"J. Appl. Ind. Math."},{"issue":"6","key":"9773_CR14","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"CC Kuo","year":"1993","unstructured":"Kuo, C.C., Glover, F., Dhir, K.S.: Analyzing and modeling the maximum diversity problem by zero-one programming. Decis. Sci. 24(6), 1171\u20131185 (1993)","journal-title":"Decis. Sci."},{"issue":"10","key":"9773_CR15","first-page":"89","volume":"117","author":"S McConnell","year":"1988","unstructured":"McConnell, S.: The new battle over immigration. Fortune 117(10), 89\u2013102 (1988)","journal-title":"Fortune"},{"key":"9773_CR16","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"9773_CR17","volume-title":"Cowpea germplasm catalog No. 1","author":"WM Porter","year":"1975","unstructured":"Porter, W.M., Eawal, K.M., Rachie, K.O., Wien, H.C., Willians, R.C.: Cowpea germplasm catalog No. 1. International Institute of Tropical Agriculture, Ibadan, Nigeria (1975)"},{"issue":"3","key":"9773_CR18","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1134\/S1990478912030131","volume":"6","author":"VV Shenmaier","year":"2012","unstructured":"Shenmaier, V.V.: An approximation scheme for a problem of search for a vector subset. J. Appl. Ind. Math. 6(3), 381\u2013386 (2012)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"9773_CR19","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1134\/S199047891604013X","volume":"10","author":"VV Shenmaier","year":"2016","unstructured":"Shenmaier, V.V.: Solving some vector subset problems by Voronoi diagrams. J. Appl. Ind. Math. 10(4), 560\u2013566 (2016)","journal-title":"J. Appl. Ind. Math."},{"key":"9773_CR20","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: Some easy and some not so easy geometric optimization problems. In: Epstein, L., Erlebach, T (eds.) Approximation and Online Algorithms. WAOA 2018. Lecture Notes in Computer Science, vol. 11312, pp 3\u201318. Springer, Cham (2018)","DOI":"10.1007\/978-3-030-04693-4_1"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09773-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09773-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09773-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T02:15:00Z","timestamp":1660097700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09773-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,22]]},"references-count":20,"journal-issue":{"issue":"7-9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["9773"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09773-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2021,9,22]]},"assertion":[{"value":"10 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}