{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:39Z","timestamp":1725543999730},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343066"},{"type":"electronic","value":"9783540343073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11757375_11","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T07:59:15Z","timestamp":1148025555000},"page":"119-125","source":"Crossref","is-referenced-by-count":5,"title":["Expected-Case Analysis for Delayed Filtering"],"prefix":"10.1007","author":[{"given":"Irit","family":"Katriel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                           5\/2 algorithm for maximum matching in bipartite graphs. SIAM J. Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Computing"},{"key":"11_CR2","unstructured":"Mercier, L., Van Hentenryck, P.: Strong polynomiality of resource constraint propagation (2005)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-540-30201-8_40","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C.-G. Quimper","year":"2004","unstructured":"Quimper, C.-G., L\u00f3pez-Ortiz, A., van Beek, P., Golynski, A.: Improved algorithms for the global cardinality constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 542\u2013556. Springer, Heidelberg (2004)"},{"key":"11_CR4","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"11_CR5","unstructured":"R\u00e9gin, J.-C.: Generalized Arc-Consistency for Global Cardinality Constraint. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 209\u2013215 (1996)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11757375_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:08Z","timestamp":1619507048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11757375_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343066","9783540343073"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11757375_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}