1. Brand, J.V.D., Lee, Y.T., Liu, Y.P., Saranurak, T., Sidford, A., Song, Z., Wang, D.: Minimum cost flows, MDPs, and $$\ell _1$$-regression in nearly linear time for dense instances. In: Proc. 53 Annual ACM Symp. on Theory of Comp., pp. 859–869 (2021)
2. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley and Sons, New York (1998)
3. Duan, R., He, H., Zhang, T.: A scaling algorithm for weighted f-factors in general graphs. In: Proc. of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), vol. 168 of LIPIcs, pp. 41:1–41:17 (2020)
4. Duan, R., Pettie, S., Su, H.-H.: Scaling algorithms for weighted matching in general graphs. ACM Trans. Algorithms 14(1), 1–35 (2018)
5. Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Stand. 69B, 125–130 (1965)