Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality.
Moe KayaliDan SuciuPublished in: CoRR (2022)
Keyphrases
- max flow
- linear program
- linear programming
- convex programming
- interior point methods
- min cut
- interior point
- energy minimization
- simplex method
- primal dual
- optimal solution
- column generation
- lp relaxation
- quadratic programming
- np hard
- objective function
- dynamic programming
- convex functions
- mixed integer
- linear programming problems
- graph cuts
- convex relaxation
- social network analysis
- phase unwrapping
- convex optimization
- directed graph
- semidefinite programming
- image segmentation
- graph structure