---
title: "Fast Algorithm for Connected Row Convex Constraints"
authors:
  - "Yuanlin Zhang"
doi: ""
url: "https://ijcai.org/proceedings/2007/29"
pdf: "https://ijcai.org/proceedings/2007/0029.pdf"
venue: "Proceedings of the Twentieth International Joint Conference on Artificial Intelligence"
year: 2007
pages: "192-196"
track: ""
keywords:
---

# Fast Algorithm for Connected Row Convex Constraints

Yuanlin Zhang

*Proceedings of the Twentieth International Joint Conference on Artificial Intelligence*, pages 192-196.

## 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.