Login / Signup

FPT approximation and subexponential algorithms for covering few or many edges.

Fedor V. FominPetr A. GolovachTanmay InamdarTomohiro Koana
Published in: Inf. Process. Lett. (2024)
Keyphrases
  • theoretical analysis
  • recently developed
  • data structure
  • computational cost
  • computational complexity
  • data sets
  • worst case
  • convergence rate