Sciweavers

Share
SODA
2003
ACM

Improved results for directed multicut

9 years 2 months ago
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.
Anupam Gupta
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SODA
Authors Anupam Gupta
Comments (0)
books