2 citations · 4 across the 4 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2008
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…
cs.DM2008★ 2 cited
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.…
cs.DM2007★ 2 cited
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…