1. R. K. Ahuja, J. B. Orlin, and R. E. Tarjan, Improved Time Bounds for the Maximum Flow Problem, Technical Report CS-TR-118-87, Department of Computer Science, Princeton University, 1987. (SIAM J. Comput., to appear.)
2. R. Bar-Yehuda and S. Even, A linear time approximation algorithm for the weighted vertex cover problem,J. Algorithms,2 (1981), 198?203.
3. K. Clarkson, A modification of the greedy algorithm for vertex cover,Inform. Process. Lett.,16 (1983), 23?25.
4. R. P. Dilworth, A decomposition theorem for partially ordered sets,Ann. of Math.,51 (1950), 161?166.
5. E. A. Dinic, Algorithm for solution of a problem of maximum flow in a network with power estimation,Soviet Math. Dokl.,11 (1970), 1277?1280.