1. Maximum matching and a polyhedron with (0,1)-vertices;Edmonds;J. Res. Nat. Bur. Standards,1965
2. Packing paths, circuits and cuts — a survey;Frank,1990
3. M.X. Goemans, A note on the parsimonious property, unpublished manuscript.
4. Survivable networks, linear programming relaxations and the parsimonius property;Goemans;Math. Programming,1993
5. Improved approximation algorithms for network design problems;Goemans,1993