Login / Signup

On the Approximate Compressibility of Connected Vertex Cover.

Diptapriyo MajumdarM. S. RamanujanSaket Saurabh
Published in: Algorithmica (2020)
Keyphrases
  • vertex cover
  • approximation algorithms
  • planar graphs
  • precedence constraints
  • partial order
  • optimality criterion
  • special case
  • polynomial time approximation
  • graphical models