{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:39Z","timestamp":1725470859488},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_34","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T08:07:42Z","timestamp":1159430862000},"page":"468-483","source":"Crossref","is-referenced-by-count":7,"title":["Generalizing AllDifferent: The SomeDifferent Constraint"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Richter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ari","family":"Freund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Naveh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"34_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ipl.2005.01.009","volume":"94","author":"G. Appa","year":"2005","unstructured":"Appa, G., Magos, D., Mourtos, I.: On the system of two all_different predicates. Info. Process. Letters\u00a094(3), 99\u2013105 (2005)","journal-title":"Info. Process. Letters"},{"key":"34_CR2","unstructured":"Barnier, N., Brisset, P.: Graph coloring for air traffic flow management. In: Proc. of 4th CP-AI-OR workshop, pp. 133\u2013147 (2002)"},{"issue":"2","key":"34_CR3","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jalgor.2004.06.008","volume":"54","author":"R. Beigel","year":"2005","unstructured":"Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289\n                    n\n                  ). J. of Algorithms\u00a054(2), 168\u2013204 (2005)","journal-title":"J. of Algorithms"},{"key":"34_CR4","unstructured":"Bodlaender, H.L., Kratsch, D.: An exact algorithm for graph coloring with polynomial memory. Technical Report UU-CS-2006-015. Department of Information and Computing Sciences. Utrecht University (2006)"},{"issue":"4","key":"34_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D.: New methods to color the vertices of a graph. Communication of ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communication of ACM"},{"key":"34_CR6","unstructured":"Byskov, J.M.: Exact algorithms for graph colouring and exact satisfiability. Ph.D thesis, University of Aarhus, Aarhus, Denmark (2005)"},{"key":"34_CR7","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers, San Francisco (2003)"},{"issue":"2","key":"34_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Small maximal independent sets and faster excat graph coloring. J. Graph Algorithms and Applications\u00a07(2), 131\u2013140 (2003)","journal-title":"J. Graph Algorithms and Applications"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Gr\u00f6nkvist, M.: A constraint programming model for tail assignment. In: Proc. of 1st CP-AI-OR Conf., pp. 142\u2013156 (2004)","DOI":"10.1007\/978-3-540-24664-0_10"},{"key":"34_CR10","unstructured":"Klotz, W.: Graph coloring algorithms. Technical Report Mathematik-Bericht 2002\/5 TU Clausthal (2002)"},{"issue":"3","key":"34_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A note on the complexity of the chromatic number problem. Info. Process. Letters\u00a05(3), 66\u201367 (1976)","journal-title":"Info. Process. Letters"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1007\/11564751_120","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"Y. Naveh","year":"2005","unstructured":"Naveh, Y., Emek, R.: Random stimuli generation for functional hardware verification as a cp application. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 882\u2013882. Springer, Heidelberg (2005)"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-540-45193-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C.-G. Quimper","year":"2003","unstructured":"Quimper, C.-G., van Beek, P., L\u00f3pez-Ortiz, A., Golynski, A., Sadjad, S.B.S.: An efficient bounds consistency algorithm for the global cardinality constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 600\u2013614. Springer, Heidelberg (2003)"},{"key":"34_CR14","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. Technical Report R.R.LIRMM 93-068; (1993) Conf. version at AAAI 1994"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-540-45193-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Approximated Consistency for Knapsack Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 679\u2013693. Springer, Heidelberg (2003)"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-540-45193-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Cost-based filtering for shorter path constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/11564751_72","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"M. Sellmann","year":"2005","unstructured":"Sellmann, M.: Approximated consistency for the automatic recording problem. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 822\u2013826. Springer, Heidelberg (2005)"},{"key":"34_CR18","unstructured":"Tsang, E., Ford, J., Mills, P., Bradwell, R., Williams, R., Scott, P.: ZDC-rostering: A personnel scheduling system based on constraint programming. Technical Report 406, University of Essex, Colchester, UK (2004)"},{"key":"34_CR19","unstructured":"van Hoeve, W.-J.: The Alldifferent constraint: a systematic overview. Under construction (2006), \n                    \n                      http:\/\/www.cs.cornell.edu\/~vanhoeve"},{"key":"34_CR20","volume-title":"Introduction to graph theory","author":"D.B. West","year":"2000","unstructured":"West, D.B.: Introduction to graph theory. Prentice Hall, Englewood Cliffs (2000)"},{"key":"34_CR21","unstructured":"Yang, R.: Solving a workforce management problem with constraint programming. In: The 2nd International Conference on the Practical Application of Constraint Technology, pp. 373\u2013387, The Practical Application Company Ltd. (1996)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:57:17Z","timestamp":1558270637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11889205_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}