Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover.

Published in: CoRR (2022)

Keyphrases

independent set
vertex cover
approximation algorithms
planar graphs
maximum weight
partial order
precedence constraints
polynomial time approximation
special case
np hard
minimum cost
scheduling problem
graphical models
log likelihood
optimality criterion