Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time.
Amir AbboudRobert KrauthgamerJason LiDebmalya PanigrahiThatchaphol SaranurakOhad TrabelsiPublished in: FOCS (2022)
Keyphrases
- max flow
- pairwise
- min cost
- energy minimization
- tree structure
- min cut
- graph cuts
- convex programming
- convex optimization
- cutting plane
- linear programming
- phase unwrapping
- convex relaxation
- objective function
- markov random field
- similarity measure
- quadratic programming
- mixed integer
- spanning tree
- text classification
- interactive segmentation
- higher order