1 citations · 1 across the 3 of their papers we have counts for
3 papers
The Central Spanning Tree Problem
Enrique Fita Sanmartín, Christoph Schnörr, Fred A. Hamprecht
Spanning trees are an important primitive in many data analysis tasks, when a data set needs to be summarized in terms of its "skeleton", or when a tree-shaped graph over all obser…
Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources
Peter Lippmann, Enrique Fita Sanmartín, Fred A. Hamprecht
Branched Optimal Transport (BOT) is a generalization of optimal transport in which transportation costs along an edge are subadditive. This subadditivity models an increase in tran…
Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice
Erik Jenner, Enrique Fita Sanmartín, Fred A. Hamprecht
The minimum graph cut and minimum --cut problems are important primitives in the modeling of combinatorial problems in computer science, including in computer vision and mach…