{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:35:05Z","timestamp":1777592105772,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1115220"],"award-info":[{"award-number":["IIS-1115220"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1422591"],"award-info":[{"award-number":["IIS-1422591"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1422324"],"award-info":[{"award-number":["CCF-1422324"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1547167"],"award-info":[{"award-number":["CNS-1547167"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1656905"],"award-info":[{"award-number":["CCF-1656905"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00453-019-00616-2","type":"journal-article","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T06:11:37Z","timestamp":1566281497000},"page":"808-852","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Unified Framework for Clustering Constrained Data Without Locality Property"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1307-6077","authenticated-orcid":false,"given":"Hu","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"issue":"4","key":"616_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1824777.1824779","volume":"6","author":"MR Ackermann","year":"2010","unstructured":"Ackermann, M.R., Bl\u00f6mer, J., Sohler, C.: Clustering for metric and non-metric distance measures. ACM Trans. Algorithms 6(4), 59 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"616_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1798596.1798602","volume":"6","author":"G Aggarwal","year":"2010","unstructured":"Aggarwal, G., Panigrahy, R., Feder, T., Thomas, D., Kenthapadi, K., Khuller, S., Zhu, A.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 49 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"616_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 23 (2008)","journal-title":"J. ACM"},{"key":"616_CR4","unstructured":"Awasthi, P., Charikar, M., Krishnaswamy, R., Sinop, A.K.: The hardness of approximation of euclidean k-means. In: Proceedings of 31st International Symposium on Computational Geometry (SoCG\u201915), pp.\u00a0754\u2013767 (2015)"},{"key":"616_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-07557-0_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"Hyung-Chan An","year":"2014","unstructured":"An, H.-C., Bhaskara, A., Chekuri, C., Gupta, S., Madanand, V., Svensson, O.: Centrality of Trees for Capacitated k-Center, Proc. 7th International Conference Integer Programming and Combinatorial Optimization (IPCO\u201914), pp.\u00a052-63, (2014)"},{"key":"616_CR6","doi-asserted-by":"crossref","unstructured":"Andoni, A., Onak, K., Nikolov, A., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of 46th Symposium on Theory of Computing Conference (STOC\u201914) (2014)","DOI":"10.1145\/2591796.2591805"},{"key":"616_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-29344-3_3","volume-title":"LATIN 2012: Theoretical Informatics","author":"Esther M. Arkin","year":"2012","unstructured":"Arkin, E.M., D\u00edaz-B\u00e1\u00f1ez, J.M., Hurtado, F., Kumar, P., Mitchell, J.S.B., Palop, B., P\u00e9rez-Lantero, P., Saumell, M., Silveira, R.I.: Bichromatic 2-center of pairs of points. In: Proceedings of 10th Latin American Theoretical Informatics Symposium (LATIN\u201912), pp.\u00a025\u201336 (2012)"},{"key":"616_CR8","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907), pp.\u00a01027\u20131035 (2007)"},{"key":"616_CR9","doi-asserted-by":"crossref","unstructured":"Awasthi, P., Blum, A., Sheffet, O.: Stability yields a PTAS for k-median and k-means clustering. In: Proceedings of 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201910), pp.\u00a0309\u2013318 (2010)","DOI":"10.1109\/FOCS.2010.36"},{"key":"616_CR10","doi-asserted-by":"crossref","unstructured":"Bad\u014fiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of 34th ACM Symposium on Theory of Computing (STOC\u201902), pp.\u00a0250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"issue":"2","key":"616_CR11","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2450142.2450144","volume":"60","author":"M-F Balcan","year":"2013","unstructured":"Balcan, M.-F., Blum, A., Gupta, A.: Clustering under approximation stability. J. ACM 60(2), 8 (2013)","journal-title":"J. ACM"},{"key":"616_CR12","unstructured":"Balcan, M.-F., Braverman, M.: Finding low error clusterings. In: Proceedings of 22nd Conference on Learning Theory (COLT\u201909) (2009)"},{"key":"616_CR13","doi-asserted-by":"crossref","unstructured":"Basu, S., Bilenko, M., Mooney, R.J.: A Probabilistic framework for semi-supervised clustering. In: Proceedings of 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201904), pp.\u00a059\u201368 (2004)","DOI":"10.1145\/1014052.1014062"},{"key":"616_CR14","unstructured":"Bhattacharya, A., Jaiswal, R., Kumar, A.: Faster algorithms for the constrained k-means problem. In: Proceedings of 33rd Symposium on Theoretical Aspects of Computer Science (STACS\u201916), pp.\u00a016:1\u201316:13 (2016)"},{"key":"616_CR15","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Kumar, R., Tomkins, A.: Evolutionary clustering. In: Proceedings of 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201906), pp.\u00a0554\u2013560 (2006)","DOI":"10.1145\/1150402.1150467"},{"issue":"3","key":"616_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(97)00224-X","volume":"65","author":"S Chaudhuri","year":"1998","unstructured":"Chaudhuri, S., Garg, N., Ravi, R.: The p-neighbor k-center problem. Inf. Proc. Lett. 65(3), 131\u2013134 (1998)","journal-title":"Inf. Proc. Lett."},{"issue":"3","key":"616_CR17","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/070699007","volume":"39","author":"K Chen","year":"2009","unstructured":"Chen, K.: On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications. SIAM J. Comput. 39(3), 923\u2013947 (2009)","journal-title":"SIAM J. Comput."},{"key":"616_CR18","doi-asserted-by":"crossref","unstructured":"Coleman, T., Wirth, A.: A polynomial time approximation scheme for k-consensus clustering. In: Proceedings of 21st ACM-SIAM Symposium on Discrete Algorithms (SODA\u201910), pp.\u00a0729\u2013740 (2010)","DOI":"10.1137\/1.9781611973075.59"},{"key":"616_CR19","doi-asserted-by":"crossref","unstructured":"Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: Proceedings of 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS\u201908), pp.\u00a0191\u2013200 (2008)","DOI":"10.1145\/1376916.1376944"},{"key":"616_CR20","doi-asserted-by":"crossref","unstructured":"Cygan, M., Hajiaghayi, M.T., Khuller, S.: LP rounding for k-centers with non-uniform hard capacities. In: Proceedings of 53rd IEEE Symposium on Foundations of Computer Science (FOCS\u201912), pp.\u00a0273\u2013282 (2012)","DOI":"10.1109\/FOCS.2012.63"},{"key":"616_CR21","unstructured":"Dasgupta, S.: The hardness of k-means clustering. Technical Report (2008)"},{"key":"616_CR22","unstructured":"Ding, H.: Faster balanced clusterings in high dimension (2018). arXiv preprint \narXiv:1809.00932"},{"key":"616_CR23","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/978-3-642-22006-7_65","volume-title":"Automata, Languages and Programming","author":"Hu Ding","year":"2011","unstructured":"Ding, H., Xu, J.: Solving chromatic cone clustering via minimum spanning sphere. In: Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP\u201911), pp.\u00a0773\u2013784 (2011)"},{"key":"616_CR24","doi-asserted-by":"crossref","unstructured":"Ding, H., Xu, J.: Sub-linear time hybrid approximations for least trimmed squares estimator and related problems. In: Proceedings of 30th Annual Symposium on Computational Geometry (SoCG\u201914), p.\u00a0110 (2014)","DOI":"10.1145\/2582112.2582131"},{"key":"616_CR25","doi-asserted-by":"crossref","unstructured":"Ding, H., Xu, J.: A unified framework for clustering constrained data without locality property. In: Proceedings of 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201915), pp.\u00a01471\u20131490 (2015)","DOI":"10.1137\/1.9781611973730.97"},{"key":"616_CR26","unstructured":"Ding, H., Gao, J., Xu, J.: Finding global optimum for truth discovery: entropy based geometric variance. In: Proceedings of 32nd Symposium on Computational Geometry (SoCG\u201916), pp.\u00a034:1\u201334:16 (2016)"},{"key":"616_CR27","unstructured":"Ene, A., Har-Peled, S., Raichel, B.: Fast clustering with lower bounds: no customer too far, no shop too small (2013). CoRR \narXiv:1304.7318"},{"key":"616_CR28","unstructured":"Erickson, J.: Course lecture: extensions of maximum flow (2019). \nhttp:\/\/jeffe.cs.illinois.edu\/teaching\/algorithms\/index.html"},{"key":"616_CR29","doi-asserted-by":"crossref","unstructured":"Feldman, D., Monemizadeh, M., Sohler, C.: A PTAS for k-means clustering based on weak coresets. In: Proceedings of 23rd ACM Symposium on Computational Geometry (SoCG\u201907), pp.\u00a011\u201318 (2007)","DOI":"10.1145\/1247069.1247072"},{"key":"616_CR30","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: Proceedings of 43rd ACM Symposium on Theory of Computing (STOC\u201911), pp.\u00a0569\u2013578 (2011)","DOI":"10.1145\/1993636.1993712"},{"key":"616_CR31","doi-asserted-by":"crossref","unstructured":"Fernandez de la Vega, W., Karpinski, M., Kenyon, C., Rabani, Y.: Approximation schemes for clustering problems. In: Proceedings of 35th ACM Symposium on Theory of Computing (STOC\u201903), pp.\u00a050\u201358 (2003)","DOI":"10.1145\/780542.780550"},{"key":"616_CR32","doi-asserted-by":"crossref","unstructured":"Gao, J., Tan, P., Cheng, H.: Semi-supervised clustering with partial background information. In: Proceedings of 6th SIAM International Conference on Data Mining (SDM\u201906), pp.\u00a0489\u2013493 (2006)","DOI":"10.1137\/1.9781611972764.46"},{"key":"616_CR33","doi-asserted-by":"crossref","unstructured":"Guha, S., Munagala, K.: Exceeding expectations and clustering uncertain data. In: Proceedings of 28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS\u201909), pp.\u00a0269\u2013278 (2009)","DOI":"10.1145\/1559795.1559836"},{"key":"616_CR34","unstructured":"Guruswami, V., Indyk, P.: Embeddings and non-approximability of geometric problems. In: Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201903), pp.\u00a0537\u2013538 (2003)"},{"key":"616_CR35","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Hu, W., Li, J., Li, S., Saha, B.: A constant factor approximation algorithm for fault-tolerant k-median. In: Proceedings of 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201914), pp.\u00a01\u201312 (2014)","DOI":"10.1145\/2854153"},{"key":"616_CR36","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Raichel, B.A.: Net and Prune: a linear time algorithm for euclidean distance problems. In: Proceedings of 45th ACM Symposium on Theory of Computing (STOC\u201913), pp. 605\u2013614 (2013)","DOI":"10.1145\/2488608.2488684"},{"key":"616_CR37","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. In: Proceedings of 10th ACM Symposium on Computational Geometry (SoCG\u201994), pp.\u00a0332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"issue":"3","key":"616_CR38","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. (CSUR) 31(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"616_CR39","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00453-013-9833-9","volume":"70","author":"R Jaiswal","year":"2014","unstructured":"Jaiswal, R., Kumar, A., Sen, S.: A simple D2-sampling based PTAS for k-means and other clustering problems. Algorithmica 70(1), 22\u201346 (2014)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"616_CR40","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant k-center problems. Theor. Comput. Sci. 242(1\u20132), 237\u2013245 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"616_CR41","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated k-center problem. SIAM J. Discrete Math. (SIAMDM) 13(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math. (SIAMDM)"},{"issue":"3","key":"616_CR42","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1137\/S0097539702404055","volume":"37","author":"SG Kolliopoulos","year":"2007","unstructured":"Kolliopoulos, S.G., Rao, S.: A nearly linear-time approximation scheme for the euclidean k-median problem. SIAM J. Comput. 37(3), 757\u2013782 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"616_CR43","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1667053.1667054","volume":"57","author":"A Kumar","year":"2010","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 5 (2010)","journal-title":"J. ACM"},{"key":"616_CR44","unstructured":"Kumar, N., Raichel, B.: Fault tolerant clustering revisited. In: Proceedings of 25th Canadian Conference on Computational Geometry (CCCG) (2013)"},{"key":"616_CR45","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-38016-7_7","volume-title":"Approximation and Online Algorithms","author":"Christiane Lammersen","year":"2013","unstructured":"Lammersen, C., Schmidt, M., Sohler, C.: Probabilistic k-median clustering in data streams. In: Proceedings of 10th International Workshop on Approximation and Online Algorithms (WAOA\u201912), pp.\u00a070\u201381 (2012)"},{"key":"616_CR46","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-14165-2_17","volume-title":"Automata, Languages and Programming","author":"Jian Li","year":"2010","unstructured":"Li, J., Yi, K., Zhang, Q.: Clustering with diversity. In: Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP\u201910), pp. 188\u2013200 (2010)"},{"key":"616_CR47","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-Diversity: privacy beyond k-anonymity. In: Proceedings of 22nd International Conference on Data Engineering (ICDE\u201906), p. 24 (2006)","DOI":"10.1109\/ICDE.2006.1"},{"issue":"1","key":"616_CR48","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J Matousek","year":"2000","unstructured":"Matousek, J.: On approximate geometric k-clustering. Discrete Comput. Geom. 24(1), 61\u201384 (2000)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"616_CR49","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338\u2013350 (1993)","journal-title":"Oper. Res."},{"key":"616_CR50","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y.,Schulman, L.J., Swamy, C.: The effectiveness of Lloyd-type methods for the k-means problem. In: Proceedings of 47th IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp.\u00a0165\u2013174 (2006)","DOI":"10.1109\/FOCS.2006.75"},{"key":"616_CR51","doi-asserted-by":"crossref","unstructured":"Sharathkumar, R., Agarwal, P.K.: A Near-linear time $$\\epsilon $$-approximation algorithm for geometric bipartite matching. In: Proceedings of 44th Symposium on Theory of Computing Conference (STOC\u201912), pp.\u00a0385\u2013394 (2012)","DOI":"10.1145\/2213977.2214014"},{"issue":"1\u20132","key":"616_CR52","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10994-009-5158-y","volume":"79","author":"V Singh","year":"2010","unstructured":"Singh, V., Mukherjee, L., Peng, J., Xu, Jinhui: Ensemble clustering using semidefinite programming with applications. Mach. Learn. 79(1\u20132), 177\u2013200 (2010)","journal-title":"Mach. Learn."},{"key":"616_CR53","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2002)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"616_CR54","first-page":"51","volume":"4","author":"C Swamy","year":"2008","unstructured":"Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. ACM Trans. Algorithms (TALG) 4(4), 51 (2008)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"5","key":"616_CR55","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: k-Anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"key":"616_CR56","unstructured":"Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: Proceedings of 17th International Conference on Machine Learning (ICML\u201900), pp.\u00a01103\u20131110 (2000)"},{"key":"616_CR57","unstructured":"Wagstaff, K., Cardie, C., Schroedl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of 8th International Conference on Machine Learning (ICML\u201901), pp.\u00a0577\u2013584 (2001)"},{"issue":"1","key":"616_CR58","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.comgeo.2007.12.002","volume":"43","author":"G Xu","year":"2010","unstructured":"Xu, G., Xu, J.: Efficient approximation algorithms for clustering point-sets. Comput. Geom. 43(1), 59\u201366 (2010)","journal-title":"Comput. Geom."},{"key":"616_CR59","unstructured":"Zhu, Z.A., Lattanzi, S., Mirrokni, V.S.: A local algorithm for finding well-connected clusters. In: Proceedings of 30th International Conference on Machine Learning (ICML\u201913), pp.\u00a0 396\u2013404 (2013)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00616-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00616-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00616-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T00:09:07Z","timestamp":1597795747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00616-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,20]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00616-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,20]]},"assertion":[{"value":"15 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}