Given an edge-weighted (di)graph and a list of sourcesink pairs of vertices of this graph, the minimum multicut problem consists in selecting a minimum-weight set of edges (or arcs), whose removal leaves no path from each source to the corresponding sink. This is a well-known NP-hard problem, and improving several previous results, we show that it remains APX-hard in unweighted directed acyclic graphs (DAG), even with only two sourcesink pairs. This is also true if we remove vertices instead of arcs. © 2011 Elsevier B.V. All rights reserved.
Bentz, C. (2011). On the hardness of finding near-optimal multicuts in directed acyclic graphs. Theoretical Computer Science, 412(39), 5325–5332. https://doi.org/10.1016/j.tcs.2011.06.003