An almost always polynomial time algorithm for the ( alpha , beta )-cover problem in bipartite graphs

The ( alpha , beta )-cover problem is the problem of finding a vertex cover S/sub X/ union S/sub Y/ with S/sub X/ contained in X and S/sub Y/ contained in Y, in a bipartite graph G=(X, Y, E) that satisfies the constraints mod S/sub x/ mod >