New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem.
Michel X. GoemansDavid P. WilliamsonPublished in: SIAM J. Discret. Math. (1994)
Keyphrases
- approximation algorithms
- np hard
- special case
- facility location problem
- worst case
- minimum cost
- primal dual
- approximation ratio
- vertex cover
- exact algorithms
- network design problem
- constant factor
- open shop
- approximation schemes
- randomized algorithms
- disjoint paths
- set cover
- np hardness
- undirected graph
- optimization problems
- learning algorithm
- genetic algorithm