@inproceedings{0c30b2559af54c31816f235451b8a046,
title = "A CSP search algorithm with reduced branching factor",
abstract = "This paper presents an attempt to construct a {"}practical{"} CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for construction of {"}theoretical{"} constraint solvers because it decreases twice the base of the exponent of the upper bound of the search algorithm. We present a solver based on the strategy. The pruning mechanism of the algorithm resembles Forward Checking (FC), therefore we term it 2FC. According to our experimental evaluation, 2FC outperforms FC on graph coloring problems and on non-dense instances of randomly generated CSPs.",
author = "Igor Razgon and Amnon Meisels",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11754602\_5",
language = "English",
isbn = "354034215X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "59--72",
booktitle = "Recent Advances in Constraints - Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Revised Selected and Invited Papers",
address = "Germany",
note = "Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005 ; Conference date: 20-06-2005 Through 22-06-2005",
}