{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:50Z","timestamp":1740099650768,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"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_34","type":"book-chapter","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T06:02:59Z","timestamp":1581573779000},"page":"386-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7757-7228","authenticated-orcid":false,"given":"Alexander","family":"Kel\u2019manov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2987-9832","authenticated-orcid":false,"given":"Sergey","family":"Khamidullin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7292-7265","authenticated-orcid":false,"given":"Anna","family":"Panasenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","volume":"24","author":"T Fu","year":"2011","unstructured":"Fu, T.: A review on time series data mining. Eng. Appl. Artif. Intell. 24(1), 164\u2013181 (2011)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"34_CR2","series-title":"Remote Sensing and Digital Image Processing","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15967-6","volume-title":"Remote Sensing Time Series","author":"C Kuenzer","year":"2015","unstructured":"Kuenzer, C., Dech, S., Wagner, W.: Remote Sensing Time Series. RDIP, vol. 22. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-15967-6"},{"issue":"11","key":"34_CR3","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","volume":"38","author":"TW Liao","year":"2005","unstructured":"Liao, T.W.: Clustering of time series data \u2013 a survey. Pattern Recogn. 38(11), 1857\u20131874 (2005)","journal-title":"Pattern Recogn."},{"issue":"3","key":"34_CR4","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TSP.2003.822285","volume":"52","author":"AV Kel\u2019manov","year":"2004","unstructured":"Kel\u2019manov, A.V., Jeon, B.: A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train. IEEE Trans. Signal Process. 52(3), 645\u2013656 (2004)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6094","key":"34_CR5","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1126\/science.1223269","volume":"337","author":"JA Carter","year":"2012","unstructured":"Carter, J.A., Agol, E., et al.: Kepler-36: a pair of planets with neighboring orbits and dissimilar densities. Science 337(6094), 556\u2013559 (2012)","journal-title":"Science"},{"issue":"2","key":"34_CR6","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":"34_CR7","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."},{"key":"34_CR8","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44914-2_15"},{"key":"34_CR9","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., et al. (eds.) AIST 2017. LNCS, vol. 10716, pp. 323\u2013333. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-73013-4_30"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1134\/S0965542518010074","volume":"58","author":"AV Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A.V., Motkova, A.V.: Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center. Comput. Math. Math. Phys. 58(1), 130\u2013136 (2018)","journal-title":"Comput. Math. Math. Phys."},{"key":"34_CR11","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-93800-4_9"},{"issue":"5","key":"34_CR12","first-page":"762","volume":"41","author":"AV Kel\u2019manov","year":"2001","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A.: Posterion detection of a given number of identical subsequences in a quasi-periodic sequence. Comp. Math. Math. Phys. 41(5), 762\u2013774 (2001)","journal-title":"Comp. Math. Math. Phys."},{"issue":"2","key":"34_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1134\/S1990478914020100","volume":"8","author":"AV Kel\u2019manov","year":"2014","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A.: An approximation polynomial algorithm for a sequence partitioning problem. J. Appl. Ind. Math. 8(2), 236\u2013244 (2014)","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1134\/S0005117917010052","volume":"78","author":"AV Kel\u2019manov","year":"2017","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A., Khandeev, V.I.: Exact pseudopolynomial algorithm for one sequence partitioning problem. Autom. Remote Control 78(1), 67\u201374 (2017)","journal-title":"Autom. Remote Control"},{"issue":"3","key":"34_CR15","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":"1","key":"34_CR16","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."}],"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_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T06:08:17Z","timestamp":1581574097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40616-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406158","9783030406165"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40616-5_34","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"}}]}}