Hardness of cut problems in directed graphs

Julia Chuzhoy, Sanjeev Khanna. Hardness of cut problems in directed graphs. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 527-536, ACM, 2006. [doi]

Authors

Julia Chuzhoy

This author has not been identified. Look up 'Julia Chuzhoy' in Google

Sanjeev Khanna

This author has not been identified. Look up 'Sanjeev Khanna' in Google