Login / Signup

Generating Faster Algorithms for d-Path Vertex Cover.

Radovan CervenýOndrej Suchý
Published in: WG (2023)
Keyphrases
  • vertex cover
  • approximation algorithms
  • theoretical analysis
  • computational complexity
  • optimization problems
  • lower bound
  • worst case
  • combinatorial optimization