Author:
Guruganesh Guru Prashanth,Singla Sahil
Publisher
Springer International Publishing
Reference20 articles.
1. Aronson, J., Dyer, M., Frieze, A., Suen, S.: Randomized greedy matching. II. Random Struct. Algorithms 6(1), 55–73 (1995)
2. Chekuri, C., Quanrud, K.: Fast approximations for matroid intersection. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (2016)
3. Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Structures and Their Applications, pp. 69–87 (1970)
4. Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM J. Discrete Math. 25(3), 1251–1265 (2011)
5. Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 982–991 (2008)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Edge-Weighted Online Bipartite Matching;Journal of the ACM;2022-11-17
2. Maximum Matching in the Online Batch-arrival Model;ACM Transactions on Algorithms;2020-10-31
3. Online submodular maximization: beating 1/2 made simple;Mathematical Programming;2020-01-03
4. Faster Matroid Intersection;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11
5. Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11