96 citations · 442 across the 64 of their papers we have counts for
1 paper · 2 filters
Karl Bringmann, Danny Hermelin, Matthias Mnich +1
The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt ⊆ V(G) of size at most p, and an integer k, whether there is a set S of at most k…