Robust algorithms with polynomial loss for near-unanimity CSPs.
Víctor DalmauMarcin KozikAndrei A. KrokhinKonstantin MakarychevYury MakarychevJakub OprsalPublished in: SODA (2017)
Keyphrases
- computationally efficient
- learning algorithm
- theoretical analysis
- worst case
- optimization problems
- computational complexity
- search space
- computational cost
- constraint satisfaction
- parameter tuning
- non binary
- genetic algorithm
- data structure
- constraint satisfaction problems
- machine learning algorithms
- combinatorial optimization