J. Könemann

activity

20072023

most citedHypergraphic LP Relaxations for Steiner Trees

23 citations · 38 across the 14 of their papers we have counts for

collaborators

Showing 2017 · cs.DMShow all

2 papers · 2 filters

cs.DM2017

On the Integrality Gap of the Prize-Collecting Steiner Forest LP

Jochen Könemann, Neil Olver, Kanstantsin Pashkovich +3

In the prize-collecting Steiner forest (PCSF) problem, we are given an undirected graph $G = (V, E)$ , edge costs ${c_{e} \geq 0}_{e \in E}$ , terminal pairs ${(s_{i}, t_{i})}_{i = 1}^{k}$ , and…

cs.DM2017

A $\frac{3}{2}$ -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 $G = (V, E)$ , an additional set of edges $L$ called links and…

On the Integrality Gap of the Prize-Collecting Steiner Forest LP

A 23​-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts

A $\frac{3}{2}$ -Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts