{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:14:31Z","timestamp":1773800071165,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319730127","type":"print"},{"value":"9783319730134","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-73013-4_30","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T19:19:27Z","timestamp":1513797567000},"page":"323-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An Approximation Scheme for a Weighted Two-Cluster Partition Problem"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kel\u2019manov","sequence":"first","affiliation":[]},{"given":"Anna","family":"Motkova","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Shenmaier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"3","key":"30_CR1","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":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1134\/S0965542516020111","volume":"56","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: Fully polynomial-time approximation scheme for a special case of a quadratic euclidean 2-clustering problem. Comput. Math. Math. Phys. 56(2), 334\u2013341 (2016)","journal-title":"Comput. Math. Math. Phys."},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-44914-2_15","volume-title":"Discrete Optimization and Operations Research","author":"A Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A., Motkova, A.: A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 182\u2013192. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_15"},{"issue":"1","key":"30_CR4","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":"2","key":"30_CR5","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":"30_CR6","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":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1134\/S096554251502013X","volume":"55","author":"AV Kel\u2019manov","year":"2015","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: A randomized algorithm for two-cluster partition of a set of vectors. Comput. Math. Math. Phys. 55(2), 330\u2013339 (2015)","journal-title":"Comput. Math. Math. Phys."},{"issue":"4","key":"30_CR8","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1134\/S1990478915040067","volume":"9","author":"AV Kel\u2019manov","year":"2015","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors. J. Appl. Ind. Math. 9(4), 497\u2013502 (2015)","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1134\/S0081543816090066","volume":"295","author":"AV Dolgushev","year":"2016","unstructured":"Dolgushev, A.V., Kel\u2019manov, A.V., Shenmaier, V.V.: Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters. Proc. Steklov Inst. Math. 295(1), 47\u201356 (2016)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1134\/S1990478916030054","volume":"10","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Motkova, A.V.: Exact pseudopolynomial algorithms for a balanced 2-clustering problem. J. Appl. Ind. Math. 10(3), 349\u2013355 (2016)","journal-title":"J. Appl. Ind. Math."},{"issue":"3","key":"30_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":"4","key":"30_CR12","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."},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding $$k$$ points with minimum diameter and related problems. J. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"11","key":"30_CR14","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1134\/S0965542509110128","volume":"49","author":"AV Kel\u2019manov","year":"2009","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: Complexity of certain problems of searching for subsets of vectors and cluster analysis. Comput. Math. Math. Phys. 49(11), 1966\u20131971 (2009)","journal-title":"Comput. Math. Math. Phys."},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1134\/S1990478911040107","volume":"5","author":"AV Dolgushev","year":"2011","unstructured":"Dolgushev, A.V., Kel\u2019manov, A.V.: An approximation algorithm for solving a problem of cluster analysis. J. Appl. Ind. Math. 5(4), 551\u2013558 (2011)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1134\/S1990478910010084","volume":"1","author":"EK Gimadi","year":"2010","unstructured":"Gimadi, E.K., Pyatkin, A.V., Rykov, I.A.: On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension. J. Appl. Ind. Math. 1(4), 48\u201353 (2010)","journal-title":"J. Appl. Ind. Math."},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1134\/S1064562415050233","volume":"92","author":"AV Kel\u2019manov","year":"2015","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: NP-hardness of some quadratic euclidean 2-clustering problems. Dokl. Math. 92(2), 634\u2013637 (2015)","journal-title":"Dokl. Math."},{"issue":"3","key":"30_CR18","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1134\/S096554251603009X","volume":"56","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: On the complexity of some quadratic euclidean 2-clustering problems. Comput. Math. Math. Phys. 56(3), 491\u2013497 (2016)","journal-title":"Comput. Math. Math. Phys."},{"key":"30_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data Mining: The Textbook","author":"CC Aggarwal","year":"2015","unstructured":"Aggarwal, C.C.: Data Mining: The Textbook. Springer, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-14142-8"},{"key":"30_CR20","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer Science+Business Media, LLC, New York (2006)"},{"key":"30_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-84858-7"},{"key":"30_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to Statistical Learning","author":"G James","year":"2013","unstructured":"James, G., Witten, D., Hastie, T., Tibshirani, R.: An Introduction to Statistical Learning. Springer Science+Business Media, LLC, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-7138-7"},{"issue":"8","key":"30_CR23","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond $$k$$-means. Pattern Recognit. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recognit. Lett."},{"key":"30_CR24","volume-title":"Algorithms + Data Structures = Programs","author":"N Wirth","year":"1976","unstructured":"Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall, New Jersey (1976)"},{"key":"30_CR25","first-page":"1","volume":"31","author":"K Ball","year":"1997","unstructured":"Ball, K.: An Elementary Introduction to Modern Convex Geometry. Flavors Geom. 31, 1\u201358 (1997). MSRI Publications","journal-title":"Flavors Geom."}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73013-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:14:44Z","timestamp":1710324884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73013-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319730127","9783319730134"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73013-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}