Approximation algorithms for noncommutative constraint satisfaction problems.
Eric CulfHamoon MousaviTaro SpirigPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- constraint satisfaction problems
- np hard
- constraint satisfaction
- np complete
- special case
- constraint propagation
- constraint programming
- vertex cover
- minimum cost
- worst case
- search space
- scheduling problem
- primal dual
- exact algorithms
- integer programming
- arc consistency
- combinatorial problems
- non binary
- approximation ratio
- forward checking
- constant factor
- lower bound
- constraint networks
- linear programming
- optimal solution
- soft constraints
- knapsack problem
- linear program
- evolutionary algorithm
- solving constraint satisfaction problems
- dynamic constraint satisfaction problems
- pseudo boolean optimization