Abstract
The Max k-Uncut problem arose from the study of homophily of large-scale networks. Given an n-vertex undirected graph G=(V,E) with nonnegative weights defined on edges and a positive integer k, the Max k-Uncut problem asks to find a partition {V1,V2,⋯,Vk} of V such that the total weight of edges that are not cut is maximized. This problem is the complement of the classic Min k-Cut problem, and was proved to have surprisingly rich connection to the Densest k-Subgraph problem. In this paper, we give an approximation algorithm for Max k-Uncut using a non-uniform approach combining LP-rounding and the greedy strategy. The algorithm partitions the vertices of G into at least (1−1e)k parts in expectation, and achieves a good expected approximation ratio 12(1+(n−kn)2).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
