Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems.
Sepehr Abbasi ZadehNikhil BansalGuru GuruganeshAleksandar NikolovRoy SchwartzMohit SinghPublished in: SODA (2020)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- approximation algorithms
- constraint propagation
- np hard
- constraint programming
- np complete
- search space
- combinatorial problems
- sat problem
- constraint solving
- linear programming
- product configuration
- arc consistency
- computational problems
- non binary
- forward checking
- decomposition methods
- finite domain
- backtracking search
- constraint networks
- backtracking algorithm
- constraint optimization
- worst case
- global constraints
- temporal constraints
- tractable classes
- solving constraint satisfaction problems
- disjunctive temporal