Author:
He Kun,Li Sizhe,Sun Enze,Wang Yuyi,Wattenhofer Roger,Zhu Weihao
Publisher
Springer Nature Switzerland
Reference25 articles.
1. Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1253–1264. SIAM (2011)
2. Ashlagi, I., et al.: Min-cost bipartite perfect matching with delays. In: 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Berkeley, California, USA, August 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. SIAM (2017)
4. Lecture Notes in Computer Science;Y Azar,2018
5. Azar, Y., Ren, R., Vainstein, D.: The min-cost matching with concave delays problem. In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10–13 January 2021, pp. 301–320. SIAM (2021)