@techreport{,
TITLE = {Fast bound consistency for the global cardinality constraint},
AUTHOR = {Katriel, Irit and Thiel, Sven},
LANGUAGE = {eng},
URL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2003-1-013},
NUMBER = {MPI-I-2003-1-013},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2003},
DATE = {2003},
ABSTRACT = {We show an algorithm for bound consistency of {\em global cardinality<br>constraints}, which runs in time $O(n+n')$ plus the time required to sort<br>the<br>assignment variables by range endpoints, where $n$ is the number of<br>assignment<br>variables and $n'$ is the number of values in the union of their ranges.<br>We<br>thus offer a fast alternative to R\'egin's<br>arc consistency algorithm~\cite{Regin} which runs<br>in time $O(n^{3/2}n')$ and space $O(n\cdot n')$. Our algorithm<br>also achieves bound consistency for the number of occurrences<br>of each value, which has not been done before.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}