Towards optimal kernel for connected vertex cover in planar graphs.

Lukasz Kowalik Marcin Pilipczuk Karol Suchan

Published in: Discret. Appl. Math. (2013)

Keyphrases

vertex cover
planar graphs
kernel function
approximation algorithms
minimum weight
machine learning
markov random field
belief propagation
approximate inference
least squares
higher order
maximum likelihood
partial order
weighted graph
polynomial time approximation