On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs.
Logan GroutJoseph CheriyanBundit LaekhanukitPublished in: CoRR (2021)
Keyphrases
- max flow
- min cut
- min cost
- lp relaxation
- energy minimization
- linear programming
- undirected graph
- network flow
- linear program
- integer programming
- knapsack problem
- graph cuts
- message passing
- combinatorial optimization problems
- optimal solution
- graph partitioning
- feasible solution
- markov random field
- pairwise
- energy function
- integer program
- image segmentation
- maximum a posteriori
- interior point
- valid inequalities
- directed graph
- graph structure
- dynamic programming
- belief propagation
- figure ground
- combinatorial optimization
- bayesian networks