2 citations · 2 across the 4 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
A -Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts
Samuel Fiorini, Martin Groß, Jochen Könemann +1
The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree , an additional set of edges called links and…