Funder
Israel Science Foundation
ICRC Blavatnik fund
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference21 articles.
1. Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A O(N)-competitive deterministic algorithm for online matching on a line. In: Approximation and Online Algorithms - 12Th International Workshop, pp. 11–22 (2014)
2. Ashlagi, I., Azar, Y., Charikar, M., Chiplunkar, A., Geri, O., Kaplan, H., Makhijani, R.M., Wang, Y., Wattenhofer, R.: Min-cost bipartite perfect matching with delays. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 1:1–1:20 (2017)
3. Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1051–1061 (2017)
4. Azar, Y., Ganesh, A., Ge, R., Panigrahi, D.: Online service with delay. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 551–563 (2017)
5. Bansal, N., Buchbinder, N., Gupta, A., Naor, J.: A randomized O(log2k)-competitive algorithm for metric bipartite matching. Algorithmica 68(2), 390–403 (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献