2 citations · 4 across the 4 of their papers we have counts for
4 papers
Matching Interdiction
Rico Zenklusen
In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some…
Extensions to Network Flow Interdiction on Planar Graphs
Rico Zenklusen
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget.…
Estimation of Small s-t Reliabilities in Acyclic Networks
Marco Laumanns, Rico Zenklusen
In the classical s-t network reliability problem a fixed network G is given including two designated vertices s and t (called terminals). The edges are subject to independent rando…
A tight bound on the collection of edges in MSTs of induced subgraphs
Gregory B. Sorkin, Angelika Steger, Rico Zenklusen
Let be a complete -vertex graph with distinct positive edge weights. We prove that for , the set consisting of the edges of all minimum spanning t…