Abstract
We study the global cardinality constraint (gcc) and propose an O(n1.5d) algorithm for domain consistency and an O(cn + dn) algorithm for range consistency where n is the number of variables, d the number of values in the domain, and c an output dependent variable smaller than or equal to n. We show how to prune the cardinality variables in O(n2d + n2.66) steps, detect if gcc is universal in constant time and prove that it is NP-Hard to maintain domain consistency on extended-GCC. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Quimper, C. G., López-Ortiz, A., Van Beek, P., & Golynski, A. (2004). Improved algorithms for the global cardinality constraint. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3258, 542–556. https://doi.org/10.1007/978-3-540-30201-8_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
