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

Vangelis Th. Paschos

Published in: CoRR (2019)

Keyphrases

polynomial time approximation
bipartite graph
vertex cover
approximation algorithms
np hard
error bounds
maximum matching
minimum weight
link prediction
planar graphs
bin packing
social network analysis
special case
approximation guarantees