{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:12Z","timestamp":1760441232004},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10878-014-9764-7","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T08:22:52Z","timestamp":1403166172000},"page":"589-604","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Expected computations on color spanning sets"],"prefix":"10.1007","volume":"29","author":[{"given":"Chao","family":"Li","sequence":"first","affiliation":[]},{"given":"Chenglin","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Farong","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"9764_CR1","doi-asserted-by":"crossref","unstructured":"Abellanas M, Hurtado F, Icking C, Klein R, Langetepe E, Ma L, Palop B, Sacristan V (2001a) Smallest color-spanning objects. In: Proceedings of 9th European symposium on algorithms, pp 278\u2013289","DOI":"10.1007\/3-540-44676-1_23"},{"key":"9764_CR2","unstructured":"Abellanas M, Hurtado F, Icking C, Klein R, Langetepe E, Ma L, Palop B, Sacristan V (2001b) The farthest color Voronoi diagram and related problems. In: Proceedings of the 17th European workshop on computational geometry (EWCG\u201901), pp 113\u2013116"},{"key":"9764_CR3","doi-asserted-by":"crossref","unstructured":"Afshani P, Agarwal PK, Arge L, Larsen KG, Phillips JM (2011) (Approximate) uncertain skylines. In: Proceedings of the 14th international conference on database theory, pp 186\u2013196","DOI":"10.1145\/1938551.1938576"},{"key":"9764_CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(92)90133-G","volume":"42","author":"A Aggarwal","year":"1992","unstructured":"Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P (1992) Optimal time bounds for some proximity problems in the plane. Inf Process Lett 42:55\u201360","journal-title":"Inf Process Lett"},{"key":"9764_CR5","doi-asserted-by":"crossref","unstructured":"Agarwal PK, Efrat A, Sankararaman S, Zhang W (2012a) Nearest-neighbor searching under uncertainty. In: Proceedings of the 31st symposium on principles of database systems, pp 225\u2013236","DOI":"10.1145\/2213556.2213588"},{"issue":"4","key":"9764_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2344422.2344433","volume":"8","author":"PK Agarwal","year":"2012","unstructured":"Agarwal PK, Cheng SW, Yi K (2012b) Range searching on uncertain data. ACM Trans Algorithms 8(4):1\u201317","journal-title":"ACM Trans Algorithms"},{"key":"9764_CR7","doi-asserted-by":"crossref","unstructured":"Beresford AR, Stajano F (2003) Location privacy in pervasive computing. IEEE Pervasive Comput 2(1): 46\u201355","DOI":"10.1109\/MPRV.2003.1186725"},{"issue":"4","key":"9764_CR8","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TKDE.2009.108","volume":"22","author":"MA Cheema","year":"2010","unstructured":"Cheema MA, Lin X, Wang W, Zhang W, Pei J (2010) Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Trans Knowl Data Eng 22(4):550\u2013564","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"9764_CR9","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TKDE.2004.46","volume":"16","author":"R Cheng","year":"2004","unstructured":"Cheng R, Kalashnikov DV, Prabhakar S (2004) Querying imprecise data in moving object environments, knowledge and data engineering. IEEE Trans Knowl Data Eng 16(9):1112\u20131127","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9764_CR10","unstructured":"Cheng R, Zhang Y, Bertino E, Prabhakar S (2006) Preserving user location privacy in mobile data management infrastructures. In: Proceedings of the 6th internaational workshop on privacy enhancing technologies (PET\u201906). LNCS, vol 4258, pp 393\u2013412"},{"issue":"8","key":"9764_CR11","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1109\/TKDE.2010.66","volume":"22","author":"G Cormode","year":"2010","unstructured":"Cormode G, Garofalakis M (2010) Histograms and wavelets on probabilistic data. IEEE Trans Knowl Data Eng 22(8):1142\u20131157","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9764_CR12","doi-asserted-by":"crossref","unstructured":"Cormode G, McGregor A (2008) Approximation algorithms for clustering uncertain data. In: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, pp 191\u2013200","DOI":"10.1145\/1376916.1376944"},{"issue":"4","key":"9764_CR13","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N Dalvi","year":"2007","unstructured":"Dalvi N, Suciu D (2007) Efficient query evaluation on probabilistic databases. VLDB J 16(4):523\u2013544","journal-title":"VLDB J"},{"issue":"5","key":"9764_CR14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S0218195909003076","volume":"19","author":"S Das","year":"2009","unstructured":"Das S, Goswani PP, Nandy SC (2009) Smallest color-spanning object revised. Int J Comput Geom Appl 19(5):457\u2013478","journal-title":"Int J Comput Geom Appl"},{"key":"9764_CR15","doi-asserted-by":"crossref","unstructured":"Fan C, Luo J, Zhong F (2013) On some proximity problems of colored sets. In: Proceedings of the 7th international conference on combinatorial optimization and applications, pp 202\u2013213","DOI":"10.1007\/978-3-319-03780-6_18"},{"key":"9764_CR16","unstructured":"Fleischer R, Xu X (2010) Computing minimum diameter color-spanning sets. In: Proceedings of the 4th international workshop on frontiers in algorithmics (FAW\u201910). LNCS, vol 6213, pp 285\u2013292"},{"key":"9764_CR17","doi-asserted-by":"crossref","unstructured":"Gedik B, Liu L (2005) A customizable k-anonymity model for protecting location privacy. In: Proceedings of the 25th international conference on distributed computing systems (ICDCS\u201905), pp 620\u2013629","DOI":"10.1109\/ICDCS.2005.48"},{"key":"9764_CR18","doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen A, L\u00f6ffler M, Phillips J (2011) Geometric computations on indecisive points. In: Proceedings of the 12th international symposium on algorithms and data structures, pp 536\u2013547","DOI":"10.1007\/978-3-642-22300-6_45"},{"issue":"2","key":"9764_CR19","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/s10878-012-9458-y","volume":"26","author":"W Ju","year":"2013","unstructured":"Ju W, Fan C, Luo J, Zhu B, Daescu O (2013a) On some geometric problems of color-spanning sets. J Comb Optim 26(2):266\u2013283","journal-title":"J Comb Optim"},{"issue":"4","key":"9764_CR20","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1007\/s10878-012-9488-5","volume":"26","author":"W Ju","year":"2013","unstructured":"Ju W, Luo J, Zhu B, Daescu O (2013b) Largest area convex hull of imprecise data based on axis-aligned squares. J Comb Optim 26(4):832\u2013859","journal-title":"J Comb Optim"},{"key":"9764_CR21","doi-asserted-by":"crossref","unstructured":"Kamousi P, Chan TM, Suri S (2011a) Closest pair and the post office problem for stochastic points. In: Proceedings of the 12th international symposium on algorithms and data structures, pp 548\u2013559","DOI":"10.1007\/978-3-642-22300-6_46"},{"key":"9764_CR22","doi-asserted-by":"crossref","unstructured":"Kamousi P, Chan TM, Suri S (2011b) Stochastic minimum spanning trees in euclidean spaces. In: Proceedings of the 27th ACM symposium on computational geometry, pp 65\u201374","DOI":"10.1145\/1998196.1998206"},{"key":"9764_CR23","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler M, van Kreveld M (2006) Largest and smallest tours and convex hulls for imprecise points. In: Proceedings of the 10th Scandinavian workshop on algorithm theory, pp 375\u2013387","DOI":"10.1007\/11785293_35"},{"key":"9764_CR24","first-page":"15","volume":"2007","author":"J Pei","year":"2007","unstructured":"Pei J, Jiang B, Lin X, Yuan Y (2007) Probabilistic skylines on uncertain data. VLDB 2007:15\u201326","journal-title":"VLDB"},{"key":"9764_CR25","unstructured":"Pfoser D, Jensen C (1999) Capturing the uncertainty of moving-objects representations. In: Proceedings of the 6th international symposium on advances in spatial databases (SSD\u201999). LNCS, vol 1651, pp 111\u2013131"},{"issue":"1\u20132","key":"9764_CR26","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth D (1996) On the hardness of approximate reasoning. Artif Intell 82(1\u20132):273\u2013302","journal-title":"Artif Intell"},{"key":"9764_CR27","unstructured":"Sistla PA, Wolfson O, Chamberlain S, Dao S (1997) Querying the uncertain position of moving objects. Temporal databases: research and practice, vol 1399., LNCS, Springer, Berlin, pp 310\u2013337"},{"key":"9764_CR28","unstructured":"Suri S, Verbeek K, Yildiz H (2013) On the most likely convex hull of uncertain points. In: Proceedings of ESA\u20192013. LNCS, vol 8125, pp 791\u2013802"},{"key":"9764_CR29","unstructured":"Tao Y, Cheng R, Xiao X, Ngai W-K, Kao B, Prabhakar S (2005) Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proceedings of the 31st international conference on very large data bases. pp 922\u2013933"},{"issue":"2","key":"9764_CR30","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S Vadhan","year":"1997","unstructured":"Vadhan S (1997) The complexity of counting in sparse, regular, and planar graphs. SIAM J Comput 31(2):398\u2013427","journal-title":"SIAM J Comput"},{"issue":"7","key":"9764_CR31","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/TKDE.2009.137","volume":"22","author":"SM Yuen","year":"2010","unstructured":"Yuen SM, Tao Y, Xiao X, Pei J, Zhang D (2010) Superseding nearest neighbor search on uncertain spatial databases. IEEE Trans Knowl Data Eng 22(7):1041\u20131055","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9764_CR32","doi-asserted-by":"crossref","unstructured":"Zhang D, Chee YM, Mondal A, Tung AKH, Kitsuregawa M (2009) Keyword search in spatial databases: towards searching by document. In: Proceedings of the 25th IEEE international conference on data engineering (ICDE\u201909), pp 688\u2013699","DOI":"10.1109\/ICDE.2009.77"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9764-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9764-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9764-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T18:10:36Z","timestamp":1565547036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9764-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9764"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9764-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,18]]}}}