Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems