Improved results for directed multicut

@inproceedings{Gupta2003ImprovedRF,
  title={Improved results for directed multicut},
  author={Anupam Gupta},
  booktitle={SODA},
  year={2003}
}
We give a simple algorithm for the Minimum Directed Multicut problem, and show that it gives an <i>O</i>(√<i>n</i>)-approximation. This improves on the previous approximation guarantee of <i>O</i>(√<i>n</i> log <i>k</i>) of Cheriyan, Karloff and Rabani [1], which was obtained by a more sophisticated algorithm. 
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

Representative Sets and Irrelevant Vertices: New Tools for Kernelization

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science • 2012
View 12 Excerpts
Highly Influenced

Graph-theoretic topological control of biological genetic networks

2009 American Control Conference • 2009
View 6 Excerpts
Highly Influenced

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…