minimum_multicut (343B)
1 # Minimum multicut 2 3 [costa2005minimal] 4 5 Also [minimum_length_bounded_multicut] 6 7 Special case: [bicut]: separate s from t and t from s in [graph_directed] 8 - already [NP_hard] 9 10 Lots of [approximation] results, e.g., [chitnis2019fpt] 11 - also on [directed_acyclic_graph]: 12 - [kratsch2015fixed]; also talks about [skew_multicut] 13 14 Up: [minimum_cut]