Neil Olver

activity

20102026

most citedOn explosions in heavy-tailed branching random walks

16 citations · 30 across the 17 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

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.DM2011

Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations

Michel X. Goemans, Neil Olver, Thomas Rothvoss +1

Until recently, LP relaxations have played a limited role in the design of approximation algorithms for the Steiner tree problem. In 2010, Byrka et al. presented a ln(4)+epsilon ap…