Abstract:We introduce and study WEIGHTED MIN (s, t)-CUT PREVENTION, where we are given a graph G = (V, E) with vertices s and t and an edge cost function and the aim is to choose an edge set D of total cost at most d such that G has no (s, t)-edge cut of capacity at most a that is disjoint from D. We show that WEIGHTED MIN (s, t)-CUT PREVENTION is NP-hard even on subcubcic graphs when all edges have capacity and cost one and provide a comprehensive study of the parameterized complexity of the problem. We show, for exam… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.