A note on the SDP relaxation of the minimum cut problem.
Hao HuXinxin LiJiageng WuPublished in: J. Glob. Optim. (2023)
Keyphrases
- minimum cut
- maximum flow
- graph cuts
- semidefinite
- semi definite programming
- convex relaxation
- semidefinite programming
- min cut
- weighted graph
- graph partitioning
- shortest path problem
- shortest path
- multi label
- globally optimal
- iterative algorithms
- lp relaxation
- push relabel
- directed graph
- normalized cut
- markov random field
- convex optimization
- energy function
- linear programming
- metric learning
- shape prior
- data clustering
- belief propagation
- interior point
- mean shift
- objective function