Login / Signup
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs.
Édouard Bonnet
Bruno Escoffier
Vangelis Th. Paschos
Georgios Stamoulis
Published in:
Discret. Optim. (2018)
Keyphrases
</>
vertex cover
bipartite graph
approximation algorithms
planar graphs
np hard
special case
worst case
minimum weight
link prediction
minimum cost
precedence constraints
approximation ratio
undirected graph
polynomial time approximation
partial order
random walk
constant factor