Author:
Liu Qing,Abdessalem Talel,Wu Huayu,Yuan Zihong,Bressan Stéphane
Publisher
Springer International Publishing
Reference17 articles.
1. http://edition.cnn.com/2015/10/22/opinions/hill-jobs-in-new-economy/
2. 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–276. IEEE (2011)
3. 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–193. IEEE (1996)
4. Borodin, A., Linial, N., Saks, M.E.: An optimal on-line algorithm for metrical task system. J. ACM (JACM) 39(4), 745–763 (1992)
5. 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–1033 (2015)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献