Login / Signup
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.
Édouard Bonnet
Bruno Escoffier
Vangelis Th. Paschos
Georgios Stamoulis
Published in:
LATIN (2016)
Keyphrases
</>
vertex cover
bipartite graph
dynamic programming
search space
np hard
learning algorithm
objective function
computational complexity
approximation algorithms
theoretical analysis
maximum matching
probabilistic model
simulated annealing
expectation maximization
em algorithm
polynomial time approximation