Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems.
Baris Can EsmerAriel KulikPublished in: CoRR (2024)
Keyphrases
- black box
- approximation algorithms
- vertex cover
- special case
- np hardness
- hybrid systems
- np hard
- minimum cost
- white box
- optimization problems
- approximation schemes
- randomized algorithms
- network design problem
- exact algorithms
- black boxes
- undirected graph
- primal dual
- approximation ratio
- combinatorial optimization
- directed graph
- metaheuristic
- open shop
- open source
- integration testing
- upper bound
- white box testing