A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
arXiv:1909.08435
Abstract
The paper presents a polynomial time approximation schema for the edge-weighted version of maximum k-vertex cover problem in bipartite graphs.