{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:56:19Z","timestamp":1767239779556},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_65","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"773-784","source":"Crossref","is-referenced-by-count":10,"title":["Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere"],"prefix":"10.1007","author":[{"given":"Hu","family":"Ding","sequence":"first","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.: The Farthest Color Voronoi Diagram and Related Problems. In: Abstracts 17th European Workshop Comput. Geom. (2001)"},{"key":"65_CR2","first-page":"1","volume":"52","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric Approximation via Coresets. Combinatorial and Computational Geometry\u00a052, 1\u201330 (2005)","journal-title":"Combinatorial and Computational Geometry"},{"key":"65_CR3","unstructured":"Badoiu, M., Clarkson, K.: Smaller core-sets for balls. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0801\u2013802 (2003)"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of the 34th Symposium on Theory of Computing, pp.\u00a0250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.: Farthest-Polygon Voronoi Diagrams. In: Proceedings of the 15th Annual European Conference on Algorithms, pp.\u00a0407-418 (2007)","DOI":"10.1007\/978-3-540-75520-3_37"},{"key":"65_CR6","unstructured":"Clarkson, K.: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0922\u2013931 (2008)"},{"key":"65_CR7","doi-asserted-by":"crossref","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The Upper Envelope of Voronoi Surfaces and its Application. In: Proceedings of the Seventh Annual Symposium on Computational Geometry, pp.\u00a0194\u2013203 (1991)","DOI":"10.1145\/109648.109670"},{"key":"65_CR8","unstructured":"Kumar, P., Mitchell, J., Yildirim, A.: Computing Core-Sets and Approximate Smallest Enclosing Hyperspheres in High Dimensions (2002) (manuscript)"},{"key":"65_CR9","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0747-7171(08)80067-3","volume":"10","author":"N. Megiddo","year":"1990","unstructured":"Megiddo, N.: On the Complexity of Some Geometric Problems in Unbounded Dimension. J. Symb. Comput.\u00a010, 327\u2013334 (1990)","journal-title":"J. Symb. Comput."},{"key":"65_CR10","unstructured":"Panigrahy, R.: Minimum enclosing polytope in high dimensions, CoRR cs.CG\/0407020 (2004)"},{"key":"65_CR11","unstructured":"Micali, S., Vazirani, V.V.: An \n                    \n                      \n                    \n                    $O(\\sqrt{|V|}|E|)$\n                   algorithm for finding maximum matching in general graphs. In: Proceedings of 21st IEEE Symp. Foundations of Computer Science, pp.\u00a017\u201327 (1980), doi:10.1109\/SFCS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T03:00:56Z","timestamp":1553828456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}