Approximating Max k-Uncut via LP-rounding Plus Greed, with Applications to Densest k-Subgraph.

Peng Zhang, Zhendong Liu

Browse the full AAIM paper archive.