max planck institut
informatik

# MPI-I-2003-1-013

## Fast bound consistency for the global cardinality constraint

### Katriel, Irit and Thiel, Sven

MPI-I-2003-1-013. September 2003, 30 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
421 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2003-1-013

BibTeX
@TECHREPORT{KatrielThiel2003,
AUTHOR = {Katriel, Irit and Thiel, Sven},
TITLE = {Fast bound consistency for the global cardinality constraint},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-2003-1-013},
MONTH = {September},
YEAR = {2003},
ISSN = {0946-011X},
}