{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:48:10Z","timestamp":1761562090592,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319320243"},{"type":"electronic","value":"9783319320250"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-32025-0_1","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T12:47:38Z","timestamp":1458823658000},"page":"3-17","source":"Crossref","is-referenced-by-count":19,"title":["Cost Minimization and Social Fairness for Spatial Crowdsourcing Tasks"],"prefix":"10.1007","author":[{"given":"Qing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Talel","family":"Abdessalem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huayu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihong","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"1_CR1","unstructured":"http:\/\/edition.cnn.com\/2015\/10\/22\/opinions\/hill-jobs-in-new-economy\/"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. In: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 267\u2013276. IEEE (2011)","DOI":"10.1109\/FOCS.2011.63"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 184\u2013193. IEEE (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Saks, M.E.: An optimal on-line algorithm for metrical task system. J. ACM (JACM) 39(4), 745\u2013763 (1992)","journal-title":"J. ACM (JACM)"},{"issue":"10","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.14778\/2794367.2794372","volume":"8","author":"P Cheng","year":"2015","unstructured":"Cheng, P., Lian, X., Chen, Z., Fu, R., Chen, L., Han, J., Zhao, J.: Reliable diversity-based spatial crowdsourcing by moving workers. Proc. VLDB Endow. 8(10), 1022\u20131033 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"1_CR6","unstructured":"Chrobak, M., Karloff, H., Payne, T., Vishwanathan, S.: New results on server problems. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 291\u2013300. Society for Industrial and Applied Mathematics, Philadelphia (1990)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Deng, D., Shahabi, C., Demiryurek, U.: Maximizing the number of worker\u2019s self-selected tasks in spatial crowdsourcing. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp. 324\u2013333 (2013)","DOI":"10.1145\/2525314.2525370"},{"key":"1_CR8","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: Proceedings of the VLDB Endowment, pp. 323\u2013333 (1998)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Grove, E.F.: The harmonic online k-server algorithm is competitive. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC), pp. 260\u2013266. ACM (1991)","DOI":"10.1145\/103418.103448"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2031331.2031337","volume":"13","author":"L Kazemi","year":"2011","unstructured":"Kazemi, L., Shahabi, C.: A privacy-aware framework for participatory sensing. ACM SIGKDD Explor. Newsl. 13(1), 43\u201351 (2011)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kazemi, L., Shahabi, C.: Geocrowd: enabling query answering with spatial crowdsourcing. In: Proceedings of the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp. 189\u2013198. ACM (2012)","DOI":"10.1145\/2424321.2424346"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Kazemi, L., Shahabi, C., Chen, L.: Geotrucrowd: trustworthy query answering with spatial crowdsourcing. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp. 304\u2013313 (2013)","DOI":"10.1145\/2525314.2525346"},{"issue":"5","key":"1_CR13","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. J. ACM (JACM) 42(5), 971\u2013983 (1995)","journal-title":"J. ACM (JACM)"},{"key":"1_CR14","volume-title":"Memory Versus Randomization in On-line Algorithms","author":"P Raghavan","year":"1989","unstructured":"Raghavan, P., Snir, M.: Memory Versus Randomization in On-line Algorithms, vol. 372. Springer, Heidelberg (1989)"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10100-011-0222-7","volume":"21","author":"T Rudec","year":"2013","unstructured":"Rudec, T., Baumgartner, A., Manger, R.: A fast work function algorithm for solving the k-server problem. CEJOR 21(1), 187\u2013205 (2013)","journal-title":"CEJOR"},{"issue":"10","key":"1_CR16","doi-asserted-by":"publisher","first-page":"919","DOI":"10.14778\/2732951.2732966","volume":"7","author":"H To","year":"2014","unstructured":"To, H., Ghinita, G., Shahabi, C.: A framework for protecting worker location privacy in spatial crowdsourcing. Proc. VLDB Endow. 7(10), 919\u2013930 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu, R.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645\u2013678 (2005)","journal-title":"IEEE Trans. Neural Netw."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32025-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T23:20:10Z","timestamp":1748820010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32025-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320243","9783319320250"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32025-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}