Classifying Approximation Algorithms: Understanding the APX Complexity Class.
Arthur LeeBruce XuPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- worst case
- np hardness
- np hard
- special case
- minimum cost
- vertex cover
- network design problem
- exact algorithms
- primal dual
- facility location problem
- computational complexity
- open shop
- constant factor
- approximation ratio
- set cover
- optimal solution
- randomized algorithms
- upper bound
- scheduling problem
- approximation guarantees
- constant factor approximation
- undirected graph
- combinatorial auctions
- resource allocation
- np complete
- search space
- search algorithm