{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T11:36:08Z","timestamp":1781004968982,"version":"3.54.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["788893 AMDROMA"],"award-info":[{"award-number":["788893 AMDROMA"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00453-020-00787-3","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T16:04:15Z","timestamp":1609776255000},"page":"1371-1392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities"],"prefix":"10.1007","volume":"83","author":[{"given":"Marc","family":"Bury","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Gentili","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1202-0805","authenticated-orcid":false,"given":"Chris","family":"Schwiegelshohn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mara","family":"Sorella","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"787_CR1","volume-title":"Cluster Analysis for Applications","author":"MR Anderberg","year":"1973","unstructured":"Anderberg, M.R.: Cluster Analysis for Applications. Academic Press, Cambridge (1973)"},{"key":"787_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Patrascu, M.: On the optimality of the dimensionality reduction method. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21\u201324 October 2006, Berkeley, California, USA, Proceedings, pp. 449\u2013458 (2006)","DOI":"10.1109\/FOCS.2006.56"},{"issue":"1","key":"787_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comgeo.2007.04.002","volume":"40","author":"M Badoiu","year":"2008","unstructured":"Badoiu, M., Clarkson, K.L.: Optimal core-sets for balls. Comput. Geom. 40(1), 14\u201322 (2008)","journal-title":"Comput. Geom."},{"issue":"8\u201313","key":"787_CR4","first-page":"1157","volume":"29","author":"AZ Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. Comput. Netw. 29(8\u201313), 1157\u20131166 (1997)","journal-title":"Comput. Netw."},{"key":"787_CR5","unstructured":"Bury, M., Schwiegelshohn, C.: On Finding the Jaccard Center. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 23:1\u201323:14 (2017)"},{"key":"787_CR6","unstructured":"Bury, M., Schwiegelshohn, C., Sorella, M. Sketch \u2019em all: fast approximate similarity search for dynamic data streams. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM 2018, Marina Del Rey, CA, USA, February 5\u20139, 2018, pp. 72\u201380 (2018)"},{"issue":"1","key":"787_CR7","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/s00453-014-9952-y","volume":"74","author":"Z-Z Chen","year":"2016","unstructured":"Chen, Z.-Z., Ma, B., Wang, L.: Randomized fixed-parameter algorithms for the closest string problem. Algorithmica 74(1), 466\u2013484 (2016)","journal-title":"Algorithmica"},{"issue":"5","key":"787_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/2816813","volume":"62","author":"F Chierichetti","year":"2015","unstructured":"Chierichetti, F., Kumar, R.: LSH-preserving functions and their applications. J. ACM 62(5), 33 (2015)","journal-title":"J. ACM"},{"key":"787_CR9","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28\u2013July 1, 2009, pp. 219\u2013228 (2009)"},{"key":"787_CR10","unstructured":"Chierichetti, F., Kumar, R., Pandey, S., Vassilvitskii, S.: Finding the Jaccard median. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17\u201319, 2010, pp. 293\u2013311 (2010)"},{"key":"787_CR11","unstructured":"Chimani, M., Woste, M., B\u00f6cker, S.: A closer look at the closest string and closest substring problem. In: Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011, pp. 13\u201324 (2011)"},{"key":"787_CR12","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms 6(4) (2010)","DOI":"10.1145\/1824777.1824783"},{"issue":"1","key":"787_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E Cohen","year":"2001","unstructured":"Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng. 13(1), 64\u201378 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"787_CR14","unstructured":"Cygan, M., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Lower bounds for approximation schemes for closest string. In: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22\u201324, 2016, Reykjavik, Iceland, pp. 12:1\u201312:10 (2016)"},{"key":"787_CR15","unstructured":"Das, A., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8\u201312, 2007, pp. 271\u2013280 (2007)"},{"key":"787_CR16","unstructured":"Fellows, M.R., Gramm, J., Niedermeier, R.: On the parameterized intractability of CLOSEST substringsize and related problems. In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes\u2013Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 262\u2013273 (2002)"},{"issue":"4","key":"787_CR17","doi-asserted-by":"publisher","first-page":"857","DOI":"10.2307\/2528823","volume":"27","author":"JC Gower","year":"1971","unstructured":"Gower, J.C.: A general coefficient of similarity and some of its properties. Biometrics 27(4), 857\u2013871 (1971)","journal-title":"Biometrics"},{"issue":"1","key":"787_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01896809","volume":"3","author":"JC Gower","year":"1986","unstructured":"Gower, J.C., Legendre, P.: Metric and Euclidean properties of dissimilarity coefficients. J. Classif. 3(1), 5\u201348 (1986)","journal-title":"J. Classif."},{"issue":"1","key":"787_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for CLOSEST STRING and related problems. Algorithmica 37(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"5","key":"787_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S Guha","year":"2000","unstructured":"Guha, S., Rastogi, R., Shim, K.: ROCK: A robust clustering algorithm for categorical attributes. Inf. Syst. 25(5), 345\u2013366 (2000)","journal-title":"Inf. Syst."},{"key":"787_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2013.05.006","volume":"525","author":"J Guo","year":"2014","unstructured":"Guo, J., Hermelin, D., Komusiewicz, C.: Local search for string problems: Brute-force is essentially optimal. Theor. Comput. Sci. 525, 30\u201341 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"787_CR22","first-page":"241","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: Distribution de la flore alpine dans le bassin des Dranses et dans quelques r\u00e9gions voisines. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles 37, 241\u2013272 (1901)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"key":"787_CR23","unstructured":"Janssens, S.: Bell inequalities in cardinality-based similarity measurement. PhD thesis, Ghent University (2006)"},{"key":"787_CR24","doi-asserted-by":"crossref","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithmics 8 (2003)","DOI":"10.1145\/996546.996548"},{"issue":"2","key":"787_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. J. ACM 49(2), 157\u2013171 (2002)","journal-title":"J. ACM"},{"issue":"4","key":"787_CR26","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B Ma","year":"2009","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM J. Comput. 39(4), 1432\u20131443 (2009)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"787_CR27","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/060673898","volume":"38","author":"D Marx","year":"2008","unstructured":"Marx, D.: Closest substring problems with small distances. SIAM J. Comput. 38(4), 1382\u20131410 (2008)","journal-title":"SIAM J. Comput."},{"key":"787_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"issue":"3","key":"787_CR29","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1093\/sysbio\/45.3.380","volume":"45","author":"R Real","year":"1996","unstructured":"Real, R., Vargas, J.M.: The probabilistic basis of jaccard\u2019s index of similarity. Syst. Biol. 45(3), 380\u2013385 (1996)","journal-title":"Syst. Biol."},{"issue":"3434","key":"787_CR30","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1126\/science.132.3434.1115","volume":"132","author":"DJ Rogers","year":"1960","unstructured":"Rogers, D.J., Tanimoto, T.T.: A computer program for classifying plants. Science 132(3434), 1115\u20131118 (1960)","journal-title":"Science"},{"issue":"2","key":"787_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01720100","volume":"3","author":"H Sp\u00e4th","year":"1981","unstructured":"Sp\u00e4th, H.: The minisum location problem for the Jaccard metric. Oper. Res. Spektrum 3(2), 91\u201394 (1981)","journal-title":"Oper. Res. Spektrum"},{"issue":"4","key":"787_CR32","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1137\/0904052","volume":"4","author":"GA Watson","year":"1983","unstructured":"Watson, G.A.: An algorithm for the single facility location problem using the Jaccard metric. SIAM J. Sci. Stat. Comput. 4(4), 748\u2013756 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"6","key":"787_CR33","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1021\/ci9800211","volume":"38","author":"P Willett","year":"1998","unstructured":"Willett, P., Barnard, J.M., Downs, G.M.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6), 983\u2013996 (1998)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"3","key":"787_CR34","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1137\/070690419","volume":"19","author":"EA Yildirim","year":"2008","unstructured":"Yildirim, E.A.: Two algorithms for the minimum enclosing ball problem. SIAM J. Optim. 19(3), 1368\u20131391 (2008)","journal-title":"SIAM J. Optim."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00787-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-020-00787-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00787-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T10:19:59Z","timestamp":1617877199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-020-00787-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["787"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00787-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"30 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}