Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
Baris Can EsmerAriel KulikDániel MarxDaniel NeuenRoohani SharmaPublished in: ESA (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- set cover
- vertex cover
- search algorithm
- exact algorithms
- minimum cost
- facility location problem
- optimal solution
- genetic algorithm
- approximation ratio
- search space
- network design problem
- primal dual
- randomized algorithms
- constant factor
- np hardness
- open shop
- precedence constraints
- combinatorial optimization
- exact solution
- simulated annealing
- upper bound
- approximation schemes
- lower bound
- undirected graph
- boolean functions
- convex optimization
- polynomial time approximation
- scheduling problem