Tractable cases of the extended global cardinality constraint

Conferences in Research and Practice in Information Technology Series

Volumn 77, Issue , 2008, Pages

  Samer, Marko ^a   Szeider, Stefan ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Bounded treewidth; Domain consistency; Dynamic programming; General factor prob lem; Global constraints; Parameterized complexity

Indexed keywords

BOUNDED TREEWIDTH; DOMAIN CONSISTENCY; GENERAL FACTOR PROB-LEM; GLOBAL CONSTRAINTS; PARAMETERIZED COMPLEXITY;

CONSTRAINT THEORY; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION;

COMPUTATION THEORY;

EID: 84863573153     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Beldiceanu, N., Carlsson, M. and Rampon, J.-X. (2005), 'Global constraint catalog', Technical Re-port T2005:08. Swedish Institute of Computer Sci-ence, Stockholm, Sweden.
2. Bessiére, C., Hebrard, E., Hnich, B. and Walsh, T. (2004), The tractability of global constraints, in 'Proceedings of the 10th International Conference on Principles and Practice of Constraint Program- ming (CP'04)', Vol. 3258 of LNCS, Springer-Verlag, pp. 716-720.
3. Bodlaender, H. L. (1993), 'A tourist guide through treewidth', Acta Cybernetica 11(1-2), 1-22.
4. Bodlaender, H. L. (1996), 'A linear time algorithm for finding tree-decompositions of small treewidth', SIAM Journal on Computing 25(6), 1305-1317.
5. Bodlaender, H. L. (2005), Discovering treewidth, in 'Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Sci-ence (SOFSEM'05)', Vol. 3381 of LNCS, Springer- Verlag, pp. 1-16.
6. Bourdais, S., Galinier, P. and Pesant, G. (2003), HI-BISCUS: A constraint programming application to staff scheduling in health care, in 'Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP'03)', Vol. 2833 of LNCS, Springer-Verlag, pp. 153-167.
7. Cornuéjols, G. (1988), 'General factors of graphs', Journal of Combinatorial Theory, Series B 45(2), 185-198.
8. Courcelle, B. (1987), 'Recognizability and second-order definability for sets of finite graphs', Tech-nical Report I-8634. Université de Bordeaux, Bor-deaux, France.
9. Downey, R. G. and Fellows, M. R. (1999), Parameter-ized Complexity, Springer-Verlag
10. Fellows, M. R., Hermelin, D. and Rosamond, F. (2007), 'On the fixed-parameter intractability and tractability of multiple-interval graph problems', Manuscript.
11. Flum, J. and Grohe, M. (2006), Parameterized Com-plexity Theory, Springer-Verlag.
12. van Hoeve, W.-J. and Katriel, I. (2006), Global con-straints, in F. Rossi, P. van Beek and T. Walsh, eds,'Handbook of Constraint Programming', Elsevier, chapter 6, pp. 169-208.
13. Kloks, T. (1994), Treewidth: Computations and ap- proximations, Springer-Verlag.
14. Koster, A. M. C. A., Bodlaender, H. L. and van Hoesel, S. P. M. (2001), 'Treewidth: Computational exper-iments', Electronic Notes in Discrete Mathematics
15. Lovász, L. (1970), The factorization of graphs, in 'Combinatorial Structures and their Applications', Gordon and Breach, pp. 243-246.
16. Lovász, L. (1972), 'The factorization of graphs II', Acta Mathematica Academiae Scientiarum Hun- garicae 23, 223-246.
17. Niedermeier, R. (2006), Invitation to Fixed- Parameter Algorithms, Oxford University Press.
18. Quimper, C.-G., López-Ortiz, A., van Beek, P. and Golynski, A. (2004), Improved algorithms for the global cardinality constraint, in 'Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP'04)', Vol. 3258 of LNCS, Springer-Verlag, pp. 542-556.
19. Régin, J.-C. (1996), Generalized arc consistency for global cardinality constraint, in 'Proceedings of the 13th National Conference of the American Associ-ation for Artificial Intelligence (AAAI'96)', AAAI Press, pp. 209-215.
20. Régin, J.-C. and Gomes, C. P. (2004), The cardinality matrix constraint, in 'Proceedings of the 10th In- ternational Conference on Principles and Practice of Constraint Programming (CP'04)', Vol. 3258 of LNCS, Springer-Verlag, pp. 572-587.
21. Rossi, F., van Beek, P. and Walsh, T., (2006), Hand-book of Constraint Programming, Elsevier.
22. Sellmann, M. (2003), Cost-based filtering for shorter path constraints, in 'Proceedings of the 9th In- ternational Conference on Principles and Practice of Constraint Programming (CP'03)', Vol. 2833 of LNCS, Springer-Verlag, pp. 694-708.