An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem.
Matthias PoloczekDavid P. WilliamsonPublished in: ACM J. Exp. Algorithmics (2017)
Keyphrases
- approximation algorithms
- experimental evaluation
- np hard
- special case
- primal dual
- worst case
- vertex cover
- minimum cost
- facility location problem
- approximation ratio
- network design problem
- open shop
- np hardness
- set cover
- constant factor
- randomized algorithms
- exact algorithms
- precedence constraints
- learning algorithm
- lot sizing
- combinatorial auctions
- search space