b'@techreport{,'b'\nTITLE = {Fast bound consistency for the global cardinality constraint},\nAUTHOR = {Katriel, Irit and Thiel, Sven},\nLANGUAGE = {eng},\nURL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2003-1-013},\nNUMBER = {MPI-I-2003-1-013},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {2003},\nDATE = {2003},\nABSTRACT = {We show an algorithm for bound consistency of {\\em global cardinality constraints}, which runs in time $O(n+n\')$ plus the time required to sort the assignment variables by range endpoints, where $n$ is the number of assignment variables and $n\'$ is the number of values in the union of their ranges. We thus offer a fast alternative to R\\\'egin\'s arc consistency algorithm~\\cite{Regin} which runs in time $O(n^{3/2}n\')$ and space $O(n\\cdot n\')$. Our algorithm also achieves bound consistency for the number of occurrences of each value, which has not been done before.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'