Login / Signup
Maximum Minimal Vertex Cover Parameterized by Vertex Cover.
Meirav Zehavi
Published in:
MFCS (2) (2015)
Keyphrases
</>
vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
optimality criterion
np hard
special case
log likelihood
single machine scheduling problem
polynomial time approximation