On streaming approximation algorithms for constraint satisfaction problems.
Noah G. SingerPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- constraint satisfaction problems
- np hard
- constraint satisfaction
- np complete
- special case
- minimum cost
- constraint programming
- worst case
- constraint propagation
- arc consistency
- scheduling problem
- approximation ratio
- vertex cover
- non binary
- search space
- combinatorial problems
- soft constraints
- exact algorithms
- primal dual
- constant factor
- optimal solution
- constraint networks
- integer programming
- branch and bound algorithm
- global constraints
- undirected graph
- finding optimal solutions
- sat problem
- linear programming
- lower bound
- linear program
- tractable classes
- partial constraint satisfaction
- phase transition
- knapsack problem
- computational complexity