Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra.
Yoichi IwataYuichi YoshidaPublished in: STACS (2013)
Keyphrases
- approximation algorithms
- constraint satisfaction problems
- np hard
- constraint satisfaction
- np complete
- constraint propagation
- worst case
- special case
- constraint programming
- vertex cover
- combinatorial problems
- minimum cost
- non binary
- approximation ratio
- search space
- optimal solution
- constraint networks
- lower bound
- constraint solving
- tractable subclasses
- scheduling problem
- branch and bound algorithm
- integer programming
- linear programming
- soft constraints
- linear program
- computational complexity
- constraint problems
- primal dual
- undirected graph
- constant factor
- arc consistency
- integrality gap
- constant factor approximation
- knapsack problem
- randomly generated
- exact solution
- reasoning problems
- distributed constraint satisfaction problems
- finding optimal solutions
- temporal constraints