Constraint Programming and Graph Algorithms
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Theory and Practice of Logic Programming
Back to the Complexity of Universal Programs
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Filtering algorithms for the multiset ordering constraint
Artificial Intelligence
Multiconsistency and robustness with global constraints
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Let\Dd be a totally ordered set. Call an n-block,a Cartesian product of n closed and possibly emptyintervals of \Dd. Let \tri be the setof all 2n-tuples of elements of \Ddof the form (x_1,\ldots,x_{2n}), where (x_{n+ 1},\ldots,x_{2n}) is the n-tuple obtainedby sorting the elements of the n-tuple (x_1,\ldots,x_n)in non-decreasing order. We present and justify an algorithmof complexity \Oo(n \log n) which, given a 2n-blocka, computes a 2n-block which, by inclusion,is the smallest block containing the set \tri \cap a.We show that this complexity is optimal.