FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges.

Fedor V. Fomin Petr A. Golovach Tanmay Inamdar Tomohiro Koana

Published in: MFCS (2023)

Keyphrases

computational cost
learning algorithm
computational efficiency
times faster
benchmark datasets
multiscale
data structure
significant improvement
computationally efficient
error bounds
data sets
scale space
theoretical analysis
machine learning algorithms
orders of magnitude
approximation algorithms