2 citations · 3 across the 2 of their papers we have counts for
3 papers
MIP Formulations for the Steiner Forest Problem
Daniel Schmidt, Bernd Zey, François Margot
The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programming bounds for the problem is the key for both fast Branch-and-Bound algor…
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…
Solving -means on High-dimensional Big Data
Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
In recent years, there have been major efforts to develop data stream algorithms that process inputs in one pass over the data with little memory requirement. For the -means pro…