Improved Approximation Algorithms for the Expanding Search Problem.
Svenja M. GriesbachFelix HommelsheimMax KlimmKevin SchewiorPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- np hard
- vertex cover
- search algorithm
- special case
- network design problem
- facility location problem
- minimum cost
- set cover
- primal dual
- disjoint paths
- randomized algorithms
- approximation ratio
- np hardness
- worst case
- search space
- undirected graph
- open shop
- precedence constraints
- solution space
- evolutionary algorithm
- polynomial time approximation
- approximation schemes
- learning algorithm