Iterated rounding technique has been recently used in approximation algorithms and can be used to design even the exact algorithms. This technique exploits the structural nature of the optimal extreme solutions of the linear programming formulation.

An approximation algorithm by Jain for steiner network has used this technique in a quite novel way. Following which there are series of results which uses this result. A book by Mohit singh et al captures the technique quite beautifully.