A characterization of approximation resistance for even k-partite CSPs.
Per AustrinSubhash KhotPublished in: ITCS (2013)
Keyphrases
- constraint satisfaction problems
- search space
- constraint networks
- constraint satisfaction
- error bounds
- constraint propagation
- website
- graph structure
- relative error
- data mining
- symmetry breaking
- polygonal approximation
- approximation algorithms
- temporal constraints
- queueing networks
- constraint problems
- database
- efficient computation
- arc consistency
- closed form
- data structure
- real time