{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:33Z","timestamp":1774421313604,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T00:00:00Z","timestamp":1346198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10589-012-9503-x","type":"journal-article","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T18:47:17Z","timestamp":1346179637000},"page":"675-703","source":"Crossref","is-referenced-by-count":14,"title":["A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems"],"prefix":"10.1007","volume":"54","author":[{"given":"Hatem A.","family":"Fayed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir F.","family":"Atiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,29]]},"reference":[{"key":"9503_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471745790","volume-title":"Image Processing: Principles and Applications","author":"T. Acharya","year":"2005","unstructured":"Acharya, T., Ray, A.K.: Image Processing: Principles and Applications. Wiley, New York (2005)"},{"key":"9503_CR2","first-page":"658","volume-title":"Proc. 9th ACM-SIAM Symposium on Discrete Algorithms","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 658\u2013667 (1998)"},{"key":"9503_CR3","first-page":"250","volume-title":"Proc. 34th Annual ACM Symposium on Theory of computing (STOC\u20192002)","author":"M. B\u01cedoiu","year":"2002","unstructured":"B\u01cedoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proc. 34th Annual ACM Symposium on Theory of computing (STOC\u20192002), pp. 250\u2013257 (2002)"},{"key":"9503_CR4","first-page":"801","volume-title":"Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"M. B\u01cedoiu","year":"2003","unstructured":"B\u01cedoiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 801\u2013802 (2003)"},{"key":"9503_CR5","series-title":"LNCS","first-page":"460","volume-title":"Proc. of the European Symposium on Algorithms","author":"V. Bil\u00f2","year":"2005","unstructured":"Bil\u00f2, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Proc. of the European Symposium on Algorithms. LNCS, vol. 3669, pp. 460\u2013471 (2005)"},{"key":"9503_CR6","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases. Dept. Inf. Comput. Sci., Univ. California, Tech. Rep. (1998). http:\/\/archive.ics.uci.edu\/ml\/datasets"},{"key":"9503_CR7","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/s10878-009-9226-9","volume":"18","author":"R. Brandenberg","year":"2009","unstructured":"Brandenberg, R., Roth, L.: New algorithms for k-center and extensions. J. Comb. Optim. 18, 376\u2013392 (2009)","journal-title":"J. Comb. Optim."},{"key":"9503_CR8","unstructured":"Cook, W.J.: National traveling salesman problems. http:\/\/www.tsp.gatech.edu\/world\/countries.html"},{"key":"9503_CR9","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2001","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley, New York (2001)","edition":"2"},{"key":"9503_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"R.Z. Farahani","year":"2009","unstructured":"Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Physica-Verlag, Heidelberg (2009)"},{"key":"9503_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12, 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"9503_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"9503_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning: Data Mining Inference, and Prediction","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.H.: The Elements of Statistical Learning: Data Mining Inference, and Prediction. Springer, Berlin (2001)"},{"key":"9503_CR14","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, New York (1988)"},{"issue":"3","key":"9503_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murthy, M.N., Flynn, P.J.: Data clustering: a\u00a0review. ACM Comput. Rev. 31(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Rev."},{"key":"9503_CR16","volume-title":"Information Retrieval Architecture and Algorithms","author":"G. Kowalski","year":"2010","unstructured":"Kowalski, G.: Information Retrieval Architecture and Algorithms. Springer, Berlin (2010)"},{"key":"9503_CR17","first-page":"45","volume-title":"Proc. 5th Workshop on Algorithm Engineering and Experiments","author":"P. Kumar","year":"2003","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, A.: Computing core-sets and approximate smallest enclosing HyperSpheres in high dimensions. In: Proc. 5th Workshop on Algorithm Engineering and Experiments, pp. 45\u201355. SIAM, Philadelphia (2003)"},{"key":"9503_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/996546.996548","volume":"8","author":"P. Kumar","year":"2003","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, A.: Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithmics 8, 1\u201329 (2003)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"9503_CR19","unstructured":"Kumar, P.: Clustering and reconstructing large data sets. PhD thesis, Department of Computer Science, Stony Brook University (2004)"},{"issue":"4","key":"9503_CR20","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1142\/S0218195910003372","volume":"20","author":"P. Kumar","year":"2010","unstructured":"Kumar, P., Kumar, P.: Almost optimal solutions to k-clustering problems. Int. J. Comput. Geom. Appl. 20(4), 431\u2013447 (2010)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9503_CR21","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N. Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47, 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"key":"9503_CR22","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"13","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R 3 and related problems. SIAM J. Comput. 13, 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"9503_CR23","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13, 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9503_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"9503_CR25","unstructured":"Reinelt, G.: TSPLIB, a traveling salesman problem library. ORSA J. Comput. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9503-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9503-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9503-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T19:33:09Z","timestamp":1643311989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9503-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,29]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9503"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9503-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,29]]}}}