A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs

09/18/2019

∙

by   Vangelis Th. Paschos, et al.

∙

0

∙

share

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