1. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993
2. Degree bounded network design with metric costs;Chan;SIAM J. Comput.,2011
3. The complexity of regular subgraph recognition;Cheah;Discrete Appl. Math.,1990
4. Approximation algorithms for network design with metric costs;Cheriyan;SIAM J. Discrete Math.,2007
5. Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N.S. Narayanaswamy, C.S. Rahul, Marten Waanders, Approximation algorithms for connected graph factors of minimum weight, Theory Comput. Syst., in press.