25 citations · 57 across the 24 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
General Bounds for Incremental Maximization
Aaron Bernstein, Yann Disser, Martin Groß
We propose a theoretical framework to capture incremental solutions to cardinality constrained maximization problems. The defining characteristic of our framework is that the cardi…
cs.DM2017
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…