Improved results for directed multicut

We give a simple algorithm for the MINIMUM DIRECTED 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.

• Type: Conference
• Year: 2003
• Where: SODA
• Authors: Anupam Gupta
• Keywords: Algorithms, MINIMUM DIRECTED MULTICUT, Simple Algorithm, SODA 2003, Sophisticated Algorithm