3 citations · 7 across the 13 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 2 cited
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…
cs.DM2017
The Primal-Dual Greedy Algorithm for Weighted Covering Problems
Britta Peis, José Verschae, Andreas Wierz
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solutio…