Approximation Algorithms for the Maximum Satisfiability Problem.
Takao AsanoTakao OnoTomio HirataPublished in: Nord. J. Comput. (1996)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- network design problem
- primal dual
- precedence constraints
- set cover
- approximation ratio
- randomized algorithms
- open shop
- exact algorithms
- np hardness
- facility location problem
- disjoint paths
- computational complexity
- greedy algorithm
- polynomial time approximation
- linear programming