1. A. Agarwal, M. Charikar, K. Makarychev, Y. Makarychev, O( $$\sqrt{ \log n}$$ ) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems, in Proceeding 37th Annual ACM Symposium Theory Computing (2005), pp. 573–581,
2. S. Ahmadian, H. Hosseinzadeh, L. Sanitá, Stabilizing network bargaining games by blocking players, in Proceedings Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016 (2016), pp. 164–177
3. N. Alon, A. Shapira, B. Sudakov, Additive approximation for edge-deletion problems, in Proceedings 46th Annual IEEE Symposium Foundations Computer Science (2005), pp. 419–428
4. E. Balas, Integer and fractional matchings. N.-Holl. Math. Stud. 59, 1–13 (1981)
5. M.L. Balinski, On maximum matching, minimum covering and their connections, in Proceedings of the Princeton Symposium on Mathematical Programming (1970)