Filtering Algorithms for the NValue Constraint

The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We show that computing even the lower bound on the number of values is NP-hard. We therefore study different approximation heuristics for this problem. We introduce three new methods for computing a lower bound on the number of values. The first two are based on the maximum independent set problem and are incomparable to a previous approach based on intervals. The last method is a linear relaxation of the problem. This gives a tighter lower bound than all other methods, but at a greater asymptotic cost.

[1]  William D. Weakley,et al.  Values of Domination Numbers of the Queen's Graph , 2001, Electron. J. Comb..

[2]  Patrick Prosser,et al.  Binary Constraint Satisfaction Problems: Some are Harder than Others , 1994, ECAI.

[3]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

[6]  Odile Favaron,et al.  Some eigenvalue properties in graphs (conjectures of Graffiti - II) , 1993, Discret. Math..

[7]  Doron Zeilberger,et al.  How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic , 2000, Electron. J. Comb..

[8]  Marc Demange,et al.  Improved approximations for maximum independent set via approximation chains , 1997 .

[9]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[10]  Nicolas Beldiceanu.  Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family , 2001, CP.

[11]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[12]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[13]  Christian Bessiere,et al.  Specific Filtering Algorithms for Over-Constrained Problems , 2001, CP.

[14]  Christian Bessiere,et al.  Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.

[15]  Dror Rawitz,et al.  Hitting sets when the VC-dimension is small , 2005, Inf. Process. Lett..

[16]  François Pachet,et al.  Automatic Generation of Music Programs , 1999, CP.

[17]  Mats Carlsson,et al.  Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint , 2002 .

[18]  Toby Walsh,et al.  The Tractability of Global Constraints , 2004, CP.

[19]  Toby Walsh,et al.  The Complexity of Global Constraints , 2004, AAAI.

[20]  Edward Szpilrajn-Marczewski.  Sur deux propriétés des classes d'ensembles , 1945 .