N. Bansal, N. Buchbinder, A. Madry, and J. Naor, A Polylogarithmic-Competitive Algorithm for the k-Server Problem, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.267-276, 2011.
DOI : 10.1109/FOCS.2011.63

Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Proceedings of 37th Conference on Foundations of Computer Science, pp.184-193, 1996.
DOI : 10.1109/SFCS.1996.548477

A. Borodin, N. Linial, and M. E. Saks, An optimal on-line algorithm for metrical task system, Journal of the ACM, vol.39, issue.4, pp.745-763, 1992.
DOI : 10.1145/146585.146588

P. Cheng, X. Lian, Z. Chen, R. Fu, L. Chen et al., Reliable diversitybased spatial crowdsourcing by moving workers, Proceedings of the VLDB Endowment, pp.1022-1033, 2015.
DOI : 10.14778/2794367.2794372

URL : http://arxiv.org/pdf/1412.0223

M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New results on server problems, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '90, pp.291-300, 1990.
DOI : 10.1137/0404017

D. Deng, C. Shahabi, and U. Demiryurek, Maximizing the number of worker's selfselected tasks in spatial crowdsourcing, Proceedings of the 21st ACM SIGSPA- TIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp.324-333, 2013.

M. Ester, H. P. Kriegel, J. Sander, M. Wimmer, and X. Xu, Incremental clustering for mining in a data warehousing environment, Proceedings of the VLDB Endowment, pp.323-333, 1998.

E. F. Grove, -server algorithm is competitive, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.260-266, 1991.
DOI : 10.1145/103418.103448

L. Kazemi and C. Shahabi, A privacy-aware framework for participatory sensing, ACM SIGKDD Explorations Newsletter, vol.13, issue.1, pp.43-51, 2011.
DOI : 10.1145/2031331.2031337

URL : http://infolab.usc.edu/DocsDemos/kazemi-sigkdd2011.pdf

L. Kazemi and C. Shahabi, GeoCrowd, Proceedings of the 20th International Conference on Advances in Geographic Information Systems, SIGSPATIAL '12, pp.189-198, 2012.
DOI : 10.1145/2424321.2424346

L. Kazemi, C. Shahabi, and L. Chen, GeoTruCrowd, Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems , SIGSPATIAL'13, pp.304-313, 2013.
DOI : 10.1145/1814433.1814443

E. Koutsoupias and C. H. Papadimitriou, On the k-server conjecture, Journal of the ACM, vol.42, issue.5, pp.971-983, 1995.
DOI : 10.1145/210118.210128

P. Raghavan and M. Snir, Memory versus randomization in on-line algorithms, 1989.
DOI : 10.1007/BFb0035792

T. Rudec, A. Baumgartner, and R. Manger, A fast work function algorithm for solving the k-server problem, Central European Journal of Operations Research, vol.28, issue.1, pp.1-19, 2013.
DOI : 10.1145/2786.2793

H. To, G. Ghinita, and C. Shahabi, A framework for protecting worker location privacy in spatial crowdsourcing, Proceedings of the VLDB Endowment, pp.919-930, 2014.
DOI : 10.14778/2732951.2732966

R. Xu, Survey of Clustering Algorithms, IEEE Transactions on Neural Networks, vol.16, issue.3, pp.645-678, 2005.
DOI : 10.1109/TNN.2005.845141