Fast Algorithm for Connected Row Convex Constraints
Abstract
Many interesting tractable problems are identified under the model of Constraint Satisfaction Problems. These problems are usually solved by forcing a certain level of local consistency. In this paper, for the class of connected row convex constraints, we propose a novel algorithm which is based on the ideas of variable elimination and efficient composition of row convex and connected constraints. Compared with the existing work including randomized algorithms, the new algorithm has better worst case time and space complexity.
Cite
Text
Zhang. "Fast Algorithm for Connected Row Convex Constraints." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Zhang. "Fast Algorithm for Connected Row Convex Constraints." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/zhang2007ijcai-fast/)BibTeX
@inproceedings{zhang2007ijcai-fast,
title = {{Fast Algorithm for Connected Row Convex Constraints}},
author = {Zhang, Yuanlin},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {192-197},
url = {https://mlanthology.org/ijcai/2007/zhang2007ijcai-fast/}
}