{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:55:09Z","timestamp":1740099309250,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030226282"},{"type":"electronic","value":"9783030226299"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22629-9_38","type":"book-chapter","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:02:42Z","timestamp":1560283362000},"page":"541-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Maximum Diversity Problem with Squared Euclidean Distance"],"prefix":"10.1007","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7757-7228","authenticated-orcid":false,"given":"Alexander V.","family":"Kel\u2019manov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0832-0829","authenticated-orcid":false,"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5355-411X","authenticated-orcid":false,"given":"Artem V.","family":"Pyatkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,12]]},"reference":[{"issue":"1","key":"38_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 \n                      \n                        \n                      \n                      $$k$$\n                     points with minimum diameter and related problems. J. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"38_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). \n                      https:\/\/doi.org\/10.1007\/s10100-009-0093-3","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Cevallos, A., Eisenbrand, F., Morell, S.: Diversity maximization in doubling metrics. In: Proceedings of 29th International Symposium on Algorithms and Computation (ISAAC 2018). LIPIcs, vol. 123, pp. 33:1\u201333:12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.33","DOI":"10.4230\/LIPIcs.ISAAC.2018.33"},{"key":"38_CR4","doi-asserted-by":"publisher","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-sum diversity via convex programming. In: 32nd Annual Symposium on Computational Geometry (SoCG). LIPIcs, vol. 51, pp. 26:1\u201326:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.26","DOI":"10.4230\/LIPIcs.SoCG.2016.26"},{"key":"38_CR5","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":"38_CR6","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":"38_CR7","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"},{"key":"38_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-93800-4_9","volume-title":"Optimization Problems and Their Applications","author":"A Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A., Khandeev, V., Panasenko, A.: Randomized algorithms for some clustering problems. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds.) OPTA 2018. CCIS, vol. 871, pp. 109\u2013119. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-93800-4_9"},{"issue":"3","key":"38_CR9","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":"38_CR10","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":"1","key":"38_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1134\/S1990478912010097","volume":"6","author":"AV Kel\u2019manov","year":"2012","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M.: An approximation algorithm for solving a problem of search for a vector subset. J. Appl. Ind. Math. 6(1), 90\u201396 (2012)","journal-title":"J. Appl. Ind. Math."},{"issue":"3","key":"38_CR12","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."},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-319-73013-4_30","volume-title":"Analysis of Images, Social Networks and Texts","author":"A Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A., Motkova, A., Shenmaier, V.: An approximation scheme for a weighted two-cluster partition problem. In: van der Aalst, W.M.P., et al. (eds.) AIST 2017. LNCS, vol. 10716, pp. 323\u2013333. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-73013-4_30"},{"issue":"6","key":"38_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":"38_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":"38_CR16","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"38_CR17","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":"38_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":"38_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."}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22629-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:05:37Z","timestamp":1560283537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22629-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030226282","9783030226299"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22629-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}