Max Sat and Min Set Cover Approximation Algorithms are P-Complete.
Gian Carlo BongiovanniPierluigi CrescenziSergio De AgostinoPublished in: Parallel Process. Lett. (1995)
Keyphrases
- set cover
- approximation algorithms
- max sat
- np hard
- exact algorithms
- max sat solver
- branch and bound algorithm
- lower bound
- special case
- weighted max sat
- worst case
- minimum cost
- sat solvers
- tabu search
- vertex cover
- constraint satisfaction
- branch and bound
- sat problem
- greedy algorithm
- linear programming
- network flow
- satisfiability problem
- primal dual
- integer programming
- upper bound
- cnf formula
- greedy heuristic
- approximation ratio
- constant factor
- optimal solution
- constant factor approximation
- solution space
- search algorithm
- neural network
- scheduling problem
- genetic algorithm