Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.
Amin Coja-OghlanAndreas GoerdtAndré LankaFrank SchädlichPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- approximation algorithms
- np hard
- worst case
- vertex cover
- special case
- facility location problem
- minimum cost
- satisfiability problem
- sat solvers
- network design problem
- constant factor
- primal dual
- exact algorithms
- np hardness
- approximation ratio
- search algorithm
- combinatorial auctions
- set cover
- randomized algorithms
- constant factor approximation
- open shop
- approximation schemes
- optimal solution
- genetic algorithm