16 citations · 29 across the 19 of their papers we have counts for
4 papers · 1 filter
A Local-Search Algorithm for Steiner Forest
Martin Groß, Anupam Gupta, Amit Kumar +4
In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connec…
Robust randomized matchings
Jannik Matuschke, Martin Skutella, José A. Soto
The following game is played on a weighted graph: Alice selects a matching and Bob selects a number . Alice's payoff is the ratio of the weight of the heaviest edges of…
Rerouting flows when links fail
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
We introduce and investigate reroutable flows, a robust version of network flows in which link failures can be mitigated by rerouting the affected flow. Given a capacitated network…
The Complexity of Computing a Robust Flow
Yann Disser, Jannik Matuschke
Robust network flows are a concept for dealing with uncertainty and unforeseen failures in the network infrastructure. They and their dual counterpart, network flow interdiction, h…