1. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial Optimization, JohnWiley & Sons, NewYork, 1998.
2. K. Eswaran and R. E. Tarjan, “Augmentation problems,” SIAM J. Computing
5 (1976), 653–665.
3. A. Frank, “Connectivity augmentation problems in network design,” in Mathematical Programming: State of the Art 1994, (Eds. J. R. Birge and K. G. Murty), The University of Michigan, Ann Arbor, MI, 1994, 34–63.
4. G. N. Frederickson and J. Ja’Ja’, “Approximation algorithms for several graph augmentation problems,” SIAM J. Comput.
10 (1981), 270–283.
5. N. Garg, M. Yannakakis, and V. Vazirani, “Primal-dual approximation algorithms for integral flow and multicut in trees,” Algorithmica
18 (1997), 3–20.