Exact and approximation algorithms for the expanding search problem.
Ben HermansRoel LeusJannik MatuschkePublished in: CoRR (2019)
Keyphrases
- approximation algorithms
- np hard
- vertex cover
- special case
- worst case
- minimum cost
- network design problem
- facility location problem
- search algorithm
- open shop
- np hardness
- primal dual
- exact algorithms
- approximation schemes
- genetic algorithm
- approximation ratio
- randomized algorithms
- undirected graph
- set cover
- search space
- disjoint paths
- precedence constraints
- polynomial time approximation
- constant factor
- dynamic programming
- learning algorithm