Date of Original Version

1-2003

Type

Conference Proceeding

Abstract or Description

We give a simple algorithm for the Minimum Directed Multicut problem, and show that it gives an O(√n)-approximation. This improves on the previous approximation guarantee of O(√n log k) of Cheriyan, Karloff and Rabani [1], which was obtained by a more sophisticated algorithm.

Share

COinS
 

Published In

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 454-455.