{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:35:10Z","timestamp":1725824110165},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_14","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T11:12:41Z","timestamp":1435057961000},"page":"171-182","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Algorithm for the Smallest Color-Spanning Circle Problem"],"prefix":"10.1007","author":[{"given":"Yin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"14_CR1","first-page":"181","volume":"1","author":"DP Dobkin","year":"1983","unstructured":"Dobkin, D.P., Drysdale, R.L., Guibas, L.J.: Finding smallest polygons. Computational Geometry 1, 181\u2013214 (1983)","journal-title":"Computational Geometry"},{"key":"14_CR2","unstructured":"Overmars, M.H., Rote, G., Woeginger, G.: Finding minimum area k-gons. Utrecht University, Department of Computer Science (1989)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Imai, H., Katoh, N., et al.: Finding k points with minimum spanning trees and related problems. In: Proceedings of the Fifth Annual Symposium on Computational Geometry, pp. 283\u2013291. ACM (1989)","DOI":"10.1145\/73833.73865"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D., Overmas, M.H., Rote, G., Woeginger, G.: Finding minimum area k-gons. Discrete Comput. Geom. 7, 45\u201358 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MPRV.2003.1186725","volume":"2","author":"AR Beresford","year":"2003","unstructured":"Beresford, A.R., Stajano, F.: Location privacy in pervasive computing. IEEE Pervasive computing 2(1), 46\u201355 (2003)","journal-title":"IEEE Pervasive computing"},{"issue":"9","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TKDE.2004.46","volume":"16","author":"R Cheng","year":"2004","unstructured":"Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Querying imprecise data in moving object environments. IEEE Transactions on Knowledge and Data Engineering 16(9), 1112\u20131127 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s10878-012-9458-y","volume":"26","author":"W Ju","year":"2013","unstructured":"Ju, W., Fan, C., Luo, J., et al.: On some geometric problems of color-spanning sets. Journal of Combinatorial Optimization 26(2), 266\u2013283 (2013)","journal-title":"Journal of Combinatorial Optimization"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-44676-1_23","volume-title":"Algorithms - ESA 2001","author":"M Abellanas","year":"2001","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: Smallest color-spanning objects. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278\u2013289. Springer, Heidelberg (2001)"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"JD Morton","year":"1983","unstructured":"Morton, J.D., et al.: Sets with no empty convex 7-gons. Canadian Mathematical Bulletin 26(4), 482 (1983)","journal-title":"Canadian Mathematical Bulletin"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14553-7_27","volume-title":"Frontiers in Algorithmics","author":"R Fleischer","year":"2010","unstructured":"Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 285\u2013292. Springer, Heidelberg (2010)"},{"issue":"6","key":"14_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ipl.2008.07.002","volume":"108","author":"A Karmakar","year":"2008","unstructured":"Karmakar, A., Roy, S., Das, S.: Fast computation of smallest enclosing circle with center on a query line segment. Information Processing Letters 108(6), 343\u2013346 (2008)","journal-title":"Information Processing Letters"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, D., et al.: Keyword search in spatial databases: towards searching by document. In: IEEE 25th International Conference on Data Engineering, ICDE 2009, pp. 688\u2013699 (2009)","DOI":"10.1109\/ICDE.2009.77"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"PK Agarwal","year":"1991","unstructured":"Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., et al.: Euclidean minimum spanning trees and bichromatic closest pairs. Discrete and Computational Geometry 6(1), 407\u2013422 (1991)","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete and Computational Geometry 11(1), 321\u2013350 (1994)","journal-title":"Discrete and Computational Geometry"},{"key":"14_CR15","unstructured":"Graf, T., Hinrichs, K.: Algorithms for proximity problems on colored point sets. Universitt Mnster, Angewandte Mathematik und Informatik (1992)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T04:31:34Z","timestamp":1559190694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}