Sublinear-Space Approximation Algorithms for Max r-SAT.
Arindam BiswasVenkatesh RamanPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- facility location problem
- constant factor
- open shop
- set cover
- undirected graph
- approximation ratio
- np hardness
- randomized algorithms
- primal dual
- search space
- disjoint paths
- approximation schemes
- search algorithm
- approximation guarantees
- precedence constraints
- exact algorithms
- satisfiability problem
- linear programming
- genetic algorithm