Exact and Approximation Algorithms for the Expanding Search Problem.
Ben HermansRoel LeusJannik MatuschkePublished in: INFORMS J. Comput. (2022)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- minimum cost
- search algorithm
- facility location problem
- search space
- primal dual
- open shop
- constant factor
- randomized algorithms
- exact algorithms
- set cover
- disjoint paths
- approximation ratio
- network design problem
- solution space
- approximation schemes
- computational complexity
- optimal solution
- genetic algorithm