A parallel min-cut algorithm using iteratively reweighted least squares targeting at problems with floating-point edge weights.
Yao ZhuDavid F. GleichPublished in: Parallel Comput. (2016)
Keyphrases
- reweighted least squares
- floating point
- np hard
- dynamic programming
- edge weights
- objective function
- weighted graph
- floating point arithmetic
- optimal solution
- probabilistic model
- undirected graph
- linear programming
- spanning tree
- matching algorithm
- tree structure
- image processing
- higher order
- worst case
- bayesian networks