Improved Approximation Algorithms for the Expanding Search Problem.
Svenja M. GriesbachFelix HommelsheimMax KlimmKevin SchewiorPublished in: ESA (2023)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- search algorithm
- randomized algorithms
- facility location problem
- search space
- exact algorithms
- primal dual
- open shop
- np hardness
- computational complexity
- disjoint paths
- approximation ratio
- network design problem
- precedence constraints
- constant factor
- tabu search
- upper bound
- constant factor approximation