{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:17:23Z","timestamp":1680448643948},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,5,21]],"date-time":"2009-05-21T00:00:00Z","timestamp":1242864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10878-009-9226-9","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T16:20:00Z","timestamp":1242836400000},"page":"376-392","source":"Crossref","is-referenced-by-count":9,"title":["New algorithms for k-center and extensions"],"prefix":"10.1007","volume":"18","author":[{"given":"Ren\u00e9","family":"Brandenberg","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Roth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,21]]},"reference":[{"key":"9226_CR1","unstructured":"Agarwal PK, Procopiuc CM (1998) Exact and approximation algorithms for clustering. In: Proc 9th ACM-SIAM symp discrete alg, pp\u00a0658\u2013667"},{"issue":"4","key":"9226_CR2","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"PK Agarwal","year":"1998","unstructured":"Agarwal PK, Sharir M (1998) Efficient algorithms for geometric optimization. ACM Comput Surv 30(4):412\u2013458","journal-title":"ACM Comput Surv"},{"key":"9226_CR3","volume-title":"Probability and mathematical statistics","author":"MR Anderberg","year":"1973","unstructured":"Anderberg MR (1973) Cluster analysis for applications. In: Probability and mathematical statistics. Academic Press, London"},{"key":"9226_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02187699","volume":"1","author":"D Avis","year":"1986","unstructured":"Avis D (1986) Diameter partitioning. Discrete Comput Geom 1:265\u2013276","journal-title":"Discrete Comput Geom"},{"key":"9226_CR5","unstructured":"Bespamyatnikh S, Kirkpatrick D (1999) Rectilinear 2-center problems. In: Proc 11th Canad conf comp geom, pp\u00a068\u201371"},{"issue":"3","key":"9226_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0020-0190(00)00093-4","volume":"75","author":"S Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh S, Segal M (2000) Covering a set of points by two axis-parallel boxes. Inf Process Lett 75(3):95\u2013100","journal-title":"Inf Process Lett"},{"key":"9226_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.2307\/1968786","volume":"39","author":"HF Bohnenblust","year":"1938","unstructured":"Bohnenblust HF (1938) Convex regions and projections in Minkowski spaces. Ann Math 39:301\u2013308","journal-title":"Ann Math"},{"key":"9226_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59237-9","volume-title":"Excursions into combinatorial geometry","author":"V Boltyanski","year":"1997","unstructured":"Boltyanski V, Martini H, Soltan PS (1997) Excursions into combinatorial geometry. Springer, Berlin"},{"key":"9226_CR9","first-page":"131","volume-title":"Mathematics\u2014key technology for the future. Joint projects between universities and industry 2004\u20132007","author":"R Brandenberg","year":"2008","unstructured":"Brandenberg R, Gerken T, Gritzmann P, Roth L (2008) Modeling and optimization of correction measures for human extremities. In: J\u00e4ger W, Krebs H-J (eds) Mathematics\u2014key technology for the future. Joint projects between universities and industry 2004\u20132007. Springer, Berlin, pp 131\u2013148"},{"key":"9226_CR10","doi-asserted-by":"crossref","unstructured":"Brandenberg R, Roth L (2009) Optimal containment under homothetics. A simple cutting plane approach. Comput Optim Appl (to appear).","DOI":"10.1007\/s10589-009-9248-3"},{"key":"9226_CR11","doi-asserted-by":"crossref","unstructured":"B\u0103doiu M, Har-Peled S, Indyk P (2002) Approximate clustering via core-sets. In: Proc 34th annu ACM symp theor comput, pp\u00a0250\u2013257","DOI":"10.1145\/509907.509947"},{"key":"9226_CR12","unstructured":"Bunschoten R (1999) A fully vectorized function that computes the Euclidean distance matrix between two sets of vectors. Via http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/loadFile.do?objectId=71"},{"issue":"3","key":"9226_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan TM (1999) More planar two-center algorithms. Comput Geom Theory Appl 13(3):189\u2013198","journal-title":"Comput Geom Theory Appl"},{"key":"9226_CR14","unstructured":"Eppstein D (1997) Faster construction of planar two-centers. In: Proc 8th ACM-SIAM symp discrete alg, pp\u00a0131\u2013138"},{"key":"9226_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293\u2013306","journal-title":"Theor Comput Sci"},{"key":"9226_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02187841","volume":"7","author":"P Gritzmann","year":"1992","unstructured":"Gritzmann P, Klee V (1992) Inner and outer j-radii of convex bodies in finite-dimensional normed spaces. Discrete Comput Geom 7:255\u2013280","journal-title":"Discrete Comput Geom"},{"key":"9226_CR17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00111-U","volume":"136","author":"P Gritzmann","year":"1994","unstructured":"Gritzmann P, Klee V (1994) On the complexity of some basic problems in computational convexity I: Containment problems. Discrete Math 136:129\u2013174","journal-title":"Discrete Math"},{"issue":"1","key":"9226_CR18","first-page":"109","volume":"42","author":"D Halperin","year":"2002","unstructured":"Halperin D, Sharir M, Goldberg K (2002) The 2-center problem with obstacles. J Algebra 42(1):109\u2013134","journal-title":"J Algebra"},{"key":"9226_CR19","series-title":"Wiley series in probability and mathematical statistics","volume-title":"Clustering algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan JA (1975) Clustering algorithms. Wiley series in probability and mathematical statistics. Wiley, New York"},{"key":"9226_CR20","first-page":"175","volume":"32","author":"E Helly","year":"1923","unstructured":"Helly E (1923) \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten. Jahresbericht Deutsch Math Verein 32:175\u2013176","journal-title":"Jahresbericht Deutsch Math Verein"},{"issue":"1","key":"9226_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(93)90153-Z","volume":"47","author":"J Hershberger","year":"1993","unstructured":"Hershberger J (1993) A faster algorithm for the two-center decision problem. Inf Process Lett 47(1):23\u201329","journal-title":"Inf Process Lett"},{"issue":"3","key":"9226_CR22","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.comgeo.2004.12.002","volume":"31","author":"M Hoffmann","year":"2005","unstructured":"Hoffmann M (2005) A simple linear algorithm for computing rectilinear 3-centers. Comput Geom Theory Appl 31(3):150\u2013165","journal-title":"Comput Geom Theory Appl"},{"key":"9226_CR23","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall, Englewood Cliffs"},{"key":"9226_CR24","doi-asserted-by":"crossref","unstructured":"Jaromczyk JW, Kowaluk M (1994) An efficient algorithm for the Euclidean two-center problem. In: Symp comp geom, pp\u00a0303\u2013311","DOI":"10.1145\/177424.178038"},{"key":"9226_CR25","first-page":"187","volume-title":"Courant anniversary volume","author":"F John","year":"1948","unstructured":"John F (1948) Extremum problems with inequalities as subsidiary conditions. In: Courant anniversary volume. Interscience, New York, pp 187\u2013204"},{"key":"9226_CR26","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1515\/crll.1901.123.241","volume":"123","author":"HWE Jung","year":"1901","unstructured":"Jung HWE (1901) \u00dcber die kleinste Kugel, die eine r\u00e4umliche Figur einschlie\u00dft. J Reine Angew Math 123:241\u2013257","journal-title":"J Reine Angew Math"},{"key":"9226_CR27","unstructured":"Kumar P (2004) Clustering and reconstructing large data sets. PhD thesis, Department of Computer Science, Stony Brook University"},{"key":"9226_CR28","doi-asserted-by":"crossref","unstructured":"Kumar P, Mitchell JSB, Y\u0131ld\u0131r\u0131m EA (2003) Approximate minimum enclosing balls in high dimensions using core-sets. J Exp Algorithm 8","DOI":"10.1145\/996546.996548"},{"key":"9226_CR29","unstructured":"Kumar P, Mitchell JSB, Y\u0131ld\u0131r\u0131m EA (2003) Minimum enclosing balls: Matlab code. http:\/\/www.compgeom.com\/~piyush\/"},{"key":"9226_CR30","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01180623","volume":"62","author":"K Leichtwei\u00df","year":"1955","unstructured":"Leichtwei\u00df K (1955) Zwei Extremalprobleme der Minkowski-Geometrie. Math Z 62:37\u201349","journal-title":"Math Z"},{"key":"9226_CR31","series-title":"Computer sciences TR","first-page":"22","volume-title":"Large-scale numerical optimization","author":"OL Mangasarian","year":"1990","unstructured":"Mangasarian OL, Setiono R, Wolberg WH (1990) Pattern recognition via linear programming: theory and application to medical diagnosis. In: Coleman TF, Li Y (eds) Large-scale numerical optimization. Computer sciences TR, vol\u00a0878. SIAM, Philadelphia, pp 22\u201331"},{"issue":"3\/4","key":"9226_CR32","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0747-7171(08)80067-3","volume":"10","author":"N Megiddo","year":"1990","unstructured":"Megiddo N (1990) On the complexity of some geometric problems in unbounded dimension. J Symb Comput 10(3\/4):327\u2013334","journal-title":"J Symb Comput"},{"key":"9226_CR33","unstructured":"P\u00f3lik I (2005) Addendum to the sedumi user guide version 1.1. Technical report, Advanced Optimization Laboratory, McMaster University"},{"key":"9226_CR34","unstructured":"Procopiuc CM (1997) Clustering problems and their applications: a survey. Department of Computer Science, Duke University"},{"key":"9226_CR35","doi-asserted-by":"crossref","unstructured":"Sharir M (1996) A near-linear algorithm for the planar 2-center problem. In: Proc symp comp geom, pp\u00a0106\u2013112","DOI":"10.1145\/237218.237251"},{"key":"9226_CR36","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"JF Sturm","year":"1999","unstructured":"Sturm JF (1999) Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim Methods Softw 11\u201312:625\u2013653","journal-title":"Optim Methods Softw"},{"key":"9226_CR37","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh KC, Todd MJ, T\u00fct\u00fcnc\u00fc RH (1999) SDPT3\u2014a Matlab software package for semidefinite programming. Optim Methods Softw 11:545\u2013581","journal-title":"Optim Methods Softw"},{"key":"9226_CR38","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc RH, Toh KC, Todd MJ (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Math Program Ser B 95:189\u2013217","journal-title":"Math Program Ser B"},{"key":"9226_CR39","first-page":"111","volume-title":"Proc 17th nat conf on artif intel","author":"A del Val","year":"2000","unstructured":"del Val A (2000) On 2-SAT and renamable Horn. In: Proc 17th nat conf on artif intel. AAAI\/MIT Press, Menlo Park\/Cambridge, p\u00a0111"},{"key":"9226_CR40","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1093\/imaman\/dpl009","volume":"17","author":"H Wei","year":"2006","unstructured":"Wei H, Murray AT, Xiao N (2006) Solving the continuous space p-centre problem: planning application issues. IMA J Manag Math 17:413\u2013425","journal-title":"IMA J Manag Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9226-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9226-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9226-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:14Z","timestamp":1559276294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9226-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,21]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9226"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9226-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,21]]}}}