Abstract
We study the polynomial time approximation of the NP-hard maxk-vertex cover problem in bipartite graphs and propose purely combinatorial approximation algorithms. The main result of the paper is a simple combinatorial algorithm and a computer-assisted analysis of its approximation guarantee giving strong evidence that the worst approximation ratio achieved is bounded below by 0.821. We also study two simpler strategies with provable approximation ratios of 23 and 3447≈0.72 respectively that already beat the only such known algorithm, namely the greedy approach which guarantees ratio (1−1e)≈0.632. Our principal motivation is to bring a satisfactory answer in the following question: to what extent combinatorial methods for maxk-vertex cover compete with linear programming ones?
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.
