supported by the National Natural Science Foundation of China under Grant Nos. 60433020 and 60773111;the National Basic Research 973 Program of China under Grant No. 2008CB317107;the Provincial Natural Science Foundation of Hunan under Grant No. 06JJ10009;the Program for New Century Excellent Talents in University under Grant No. NCET-05-0683 ;the Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT0661.
The constrained minimum vertex cover problem on bipartite graphs (the Min-CVCB problem) is an important NP-complete problem. This paper presents a polynomial time approximation algorithm for the problem based on the...