{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:34:20Z","timestamp":1743107660947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030535513"},{"type":"electronic","value":"9783030535520"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-53552-0_11","type":"book-chapter","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:50:23Z","timestamp":1595004623000},"page":"96-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomized Algorithms for Some Sequence Clustering Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2987-9832","authenticated-orcid":false,"given":"Sergey","family":"Khamidullin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2978-8340","authenticated-orcid":false,"given":"Vladimir","family":"Khandeev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7292-7265","authenticated-orcid":false,"given":"Anna","family":"Panasenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"issue":"1","key":"11_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. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1134\/S0965542519050099","volume":"59","author":"AV Kel\u2019manov","year":"2019","unstructured":"Kel\u2019manov, A.V., Panasenko, A.V., Khandeev, V.I.: Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space. Comput. Math. Math. Phys. 59(5), 842\u2013850 (2019). \nhttps:\/\/doi.org\/10.1134\/S0965542519050099","journal-title":"Comput. Math. Math. Phys."},{"key":"11_CR3","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: On the complexity of some problems of choosing a subsequence of vectors. Zh. Vych. Mat. Mat. Fiz. (in Russian) 52(12), 2284\u20132291 (2012)"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1134\/S1990478912040059","volume":"6","author":"AV Kel\u2019manov","year":"2012","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M., Khamidullin, S.A.: Approximation algorithms for some intractable problems of choosing a vector subsequence. J. Appl. Indu. Math. 6(4), 443\u2013450 (2012)","journal-title":"J. Appl. Indu. Math."},{"key":"11_CR5","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M., Khamidullin, S.A.: Exact pseudopolynomial-time algorithms for some intractable problems of finding a subsequence of vectors. Zh. Vych. Mat. Mat. Fiz. (in Russian) 53(1), 143\u2013153 (2013)"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1134\/S1995423917040036","volume":"10","author":"AV Kel\u2019manov","year":"2017","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M., Khamidullin, S.A.: An approximation scheme for the problem of finding a subsequence. Numer. Anal. Appl. 10(4), 313\u2013323 (2017). \nhttps:\/\/doi.org\/10.1134\/S1995423917040036","journal-title":"Numer. Anal. Appl."},{"issue":"5","key":"11_CR7","first-page":"762","volume":"41","author":"AV Kel\u2019manov","year":"2001","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A.: Posterior detection of a given number of identical subsequences in a guasi-periodic sequence. Comput. Math. Math. Phys. 41(5), 762\u2013774 (2001)","journal-title":"Comput. Math. Math. Phys."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-030-22629-9_41","volume-title":"Mathematical Optimization Theory and Operations Research","author":"A Panasenko","year":"2019","unstructured":"Panasenko, A.: A PTAS for one cardinality-weighted 2-clustering problem. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) MOTOR 2019. LNCS, vol. 11548, pp. 581\u2013592. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-22629-9_41"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23, 555\u2013566 (1976)","journal-title":"J. ACM"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"de la Vega, F., Karpinski, M., Kenyon, C., Rabani, Y.: Polynomial time approximation schemes for metric min-sum clustering. Electronic Colloquium on Computational Complexity (ECCC). Report No. 25 (2002)","DOI":"10.1145\/780542.780550"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-38629-0_11","volume-title":"Learning and Intelligent Optimization","author":"A Kel\u2019manov","year":"2020","unstructured":"Kel\u2019manov, A., Khamidullin, S., Panasenko, A.: Exact algorithm for one cardinality-weighted 2-partitioning problem of a sequence. In: Matsatsinis, N.F., Marinakis, Y., Pardalos, P. (eds.) LION 2019. LNCS, vol. 11968, pp. 135\u2013145. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-38629-0_11"},{"key":"11_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-030-40616-5_34","volume-title":"NUMTA 2019","author":"A Kel\u2019manov","year":"2020","unstructured":"Kel\u2019manov, A., Khamidullin, S., Panasenko, A.: 2-approximation polynomial-time algorithm for a cardinality-weighted 2-partitioning problem of a sequence. In: Sergeyev, Y.D., Kvasov, D.E. (eds.) NUMTA 2019. LNCS, vol. 11974, pp. 386\u2013393. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-40616-5_34"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53552-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:57:33Z","timestamp":1595005053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53552-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030535513","9783030535520"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53552-0_11","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":"18 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION14\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}