1. J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems,”Journal of the ACM 19 (1972) 248–264.
2. Working Paper;R. Freund,1989
3. R. Freund and K. Tan, “A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming,” to appear in:Mathematics of Operations Research.
4. H.N. Gabow, “Scaling algorithms for network problems,”Journal of Computer and System Sciences 31 (1985) 148–168.
5. C. Gonzaga, “An algorithm for solving linear programming problems in O(n 3 L) operations,” in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point and Related Methods (Springer, Berlin, 1989) pp. 1–28.