Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph.
Peng ZhangZhendong LiuPublished in: AAIM (2020)
Keyphrases
- linear programming
- graph mining
- similarity graph
- dense subgraphs
- mixed integer
- np hard
- linear program
- approximation algorithms
- feasible solution
- graph data
- linear programming relaxation
- optimal solution
- primal dual
- graph databases
- column generation
- integer programming
- community discovery
- pattern mining
- connected components
- dynamic programming
- link prediction
- simplex method
- spectral clustering
- biological networks
- constraint propagation
- link analysis
- branch and bound
- tabu search
- valid inequalities
- semi supervised
- frequent subgraphs
- upper bound
- special case