Rank Vertex Cover as a Natural Problem for Algebraic Compression.

Syed Mohammad Meesum Fahad Panolan Saket Saurabh Meirav Zehavi

Published in: CoRR (2017)

Keyphrases

vertex cover
approximation algorithms
partial order
planar graphs
precedence constraints
special case
optimality criterion
higher order
polynomial time approximation
np hard