Login / Signup

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.

R. KrithikaDiptapriyo MajumdarVenkatesh Raman
Published in: Theory Comput. Syst. (2018)
Keyphrases
  • vertex cover
  • approximation algorithms
  • worst case
  • theoretical analysis
  • computational complexity
  • lower bound
  • special case
  • optimization problems
  • connected components
  • branch and bound
  • planar graphs