Treewidth-Pliability and PTAS for Max-CSPs.
Miguel RomeroMarcin WrochnaStanislav ZivnýPublished in: CoRR (2019)
Keyphrases
- search space
- constraint satisfaction problems
- constraint graph
- arc consistency
- space complexity
- maintaining arc consistency
- tree decompositions
- ordering heuristics
- constraint propagation
- tractable classes
- approximation algorithms
- constraint satisfaction
- bounded treewidth
- upper bound
- solving constraint satisfaction problems
- np hard
- np complete
- boolean functions
- approximation schemes
- polynomial time approximation
- constraint networks
- constraint programming
- soft constraints
- discrete random variables
- backtracking algorithm
- non binary
- constraint problems
- forward checking
- min cut
- tree decomposition
- decomposition methods
- optimal solution
- hypertree decomposition
- graph model
- temporal constraints
- probability distribution
- probabilistic model
- search algorithm