Search Results for author:
Found 3 papers, 2 papers with code
The Central Spanning Tree Problem
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 observations is required for downstream processing.
Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources
We here study the NP-hard optimization of BOT networks connecting a finite number of sources and sinks in $\mathbb{R}^2$.
Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice
However, we then present a simple new algorithm for seeded segmentation / graph-based semi-supervised learning that is closely based on Karger's original algorithm, showing that for these problems, extensions of Karger's algorithm can be useful.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
