Sciweavers

SODA
2003
ACM
121views Algorithms» more  SODA 2003»
14 years 1 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 Ã...
Anupam Gupta