Approximation Algorithms for the Maximum Satisfiability Problem.
Takao AsanoTakao OnoTomio HirataPublished in: SWAT (1996)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- minimum cost
- approximation ratio
- primal dual
- facility location problem
- open shop
- network design problem
- set cover
- constant factor
- approximation schemes
- precedence constraints
- disjoint paths
- randomized algorithms
- np hardness
- combinatorial auctions
- greedy algorithm