-vertex cover in bipartite graphs within ratio 0.7.

Vangelis Th. Paschos

Published in: RAIRO Oper. Res. (2018)

Keyphrases

bipartite graph
vertex cover
planar graphs
approximation algorithms
minimum weight
maximum matching
link prediction
precedence constraints
optimality criterion
partial order
maximum cardinality
polynomial time approximation
special case
worst case
np hard
state space
machine learning