{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:22Z","timestamp":1740099622496,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030406158"},{"type":"electronic","value":"9783030406165"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40616-5_36","type":"book-chapter","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T11:02:59Z","timestamp":1581591779000},"page":"400-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2978-8340","authenticated-orcid":false,"given":"Vladimir","family":"Khandeev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","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, Heidelberg (2015)"},{"key":"36_CR2","doi-asserted-by":"publisher","DOI":"10.4135\/9781452269948","volume-title":"Best Practices in Data Cleaning: A Complete Guide to Everything You Need to Do before and after Collecting Your Data","author":"JW Osborne","year":"2013","unstructured":"Osborne, J.W.: Best Practices in Data Cleaning: A Complete Guide to Everything You Need to Do before and after Collecting Your Data. SAGE Publication, Los Angeles (2013)"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Greco, L., Farcomeni, A.: Robust Methods for Data Reduction. Chapman and Hall\/CRC, London\/Boca Raton (2015)","DOI":"10.1201\/b18358"},{"key":"36_CR4","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, New York (2013)"},{"key":"36_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"},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1134\/S1054661817030038","volume":"17","author":"AA Ageev","year":"2017","unstructured":"Ageev, A.A., Kel\u2019manov, A.V., Pyatkin, A.V., Khamidullin, S.A., Shenmaier, V.V.: Approximation polynomial algorithm for the data editing and data cleaning problem. Pattern Recogn. Image Anal. 17(3), 365\u2013370 (2017)","journal-title":"Pattern Recogn. Image Anal."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-030-05348-2_28","volume-title":"Learning and Intelligent Optimization","author":"A Kel\u2019manov","year":"2019","unstructured":"Kel\u2019manov, A., Khamidullin, S., Khandeev, V., Pyatkin, A.: Exact algorithms for two quadratic euclidean problems of searching for the largest subset and longest subsequence. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P.M. (eds.) LION 12 2018. LNCS, vol. 11353, pp. 326\u2013336. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05348-2_28"},{"key":"36_CR8","first-page":"120","volume":"871","author":"A Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A., Pyatkin, A., Khamidullin, S., Khandeev, V., Shamardin, Y., Shenmaier, V.: An approximation polynomial algorithm for a problem of searching for the longest subsequence in a finite sequence of points in euclidean space. Commun. Comput. Inf. Sci. 871, 120\u2013130 (2018)","journal-title":"Commun. Comput. Inf. Sci."},{"issue":"1","key":"36_CR9","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. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"36_CR10","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":"36_CR11","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":"36_CR12","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":"36_CR13","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."},{"key":"36_CR14","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). https:\/\/doi.org\/10.1007\/978-3-319-93800-4_9"}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40616-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T20:43:41Z","timestamp":1695761021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40616-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406158","9783030406165"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40616-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Crotone","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"15 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/si.deis.unical.it\/~yaro\/numta2019\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}