Approximation and hardness results for the Max k-Uncut problem☆
Under an Elsevier user license
open archive
Keywords
Max k-Uncut
Densest k-Subgraph
Homophily
Approximation algorithm
Computational complexity
Cited by (0)
- ☆
A preliminary version of this paper appeared in the Proceedings of the 10th International Conference of Combinatorial Optimization and Applications (COCOA 2016) [25].
- 1
Part of the author's work was done when he was visiting at the University of California, Riverside, USA, and at Beijing University of Technology, China.
© 2017 Elsevier B.V.