Improved results for directed multicut

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 454-455

  Gupta, Anupam ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIALS; THEOREM PROVING;

INTEGER LINEAR PROGRAM; MINIMUM DIRECTED MULTICUT PROBLEM;

ALGORITHMS;

EID: 0037739972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Joseph Cheriyan, Howard Karloff, and Yuval Rabani. Approximating directed multicuts. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 320-328, 2001.
2. Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. Multiway cuts in directed and node-weighted graphs. In Proceedings of the 21st International Colloquium on Automata, Languages and Programming, volume 820 of Lecture Notes in Computer Science, pages 487-498, 1994.
3. T. C. Hu. Combinatorial algorithms. Addison-Wesley Publishing Company Advanced Book Program, Reading, MA, 1982.
4. David B. Shmoys. Cut problems and their application to divide-and-conquer. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 192-235, PWS Publishing, 1997.