Improved results for directed multicut
Anupam Gupta · 2003
We give a simple algorithm for the MINIMUM DIRECT-ED MULTICUT problem, and show that it gives an-approximation. This improves on the previous approximation guarantee of ��of Cheriyan, Karloff and Rabani [1], which was obtained by a more sophisticated algorithm. 1