Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
Baris Can EsmerAriel KulikDániel MarxDaniel NeuenRoohani SharmaPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- minimum cost
- search space
- search algorithm
- network design problem
- genetic algorithm
- open shop
- approximation schemes
- undirected graph
- optimal solution
- exact algorithms
- tabu search
- upper bound
- combinatorial auctions
- primal dual
- randomized algorithms
- set cover
- approximation ratio
- constant factor
- disjoint paths
- exact solution
- precedence constraints
- memetic algorithm
- approximation guarantees
- np hardness
- uniform distribution
- branch and bound
- constant factor approximation