Abstract
Given a graph G=(V,E), a weight function w: E→R+, and a parameter k, we consider the problem of finding a subset U⊆V of size k that maximizes:Max-Vertex Coverk: the weight of edges incident with vertices in U,Max-Dense Subgraphk: the weight of edges in the subgraph induced by U,Max-Cutk: the weight of edges cut by the partition (U,V\\U),Max-Uncutk: the weight of edges not cut by the partition (U,V\\U).For each of the above problems we present approximation algorithms based on semidefinite programming and obtain approximation ratios better than those previously published. In particular we show that if a graph has a vertex cover of size k, then one can select in polynomial time a set of k vertices that covers over 80% of the edges.
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.
