{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:40:20Z","timestamp":1725558020185},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_31","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T12:10:33Z","timestamp":1276344633000},"page":"287-291","source":"Crossref","is-referenced-by-count":9,"title":["The Weighted Spanning Tree Constraint Revisited"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"first","affiliation":[]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Rueher","sequence":"additional","affiliation":[]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"issue":"6","key":"31_CR2","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"Dixon, B., Rauch, M., Tarjan, R.: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput.\u00a021(6), 1184\u20131192 (1992)","journal-title":"SIAM J. Comput."},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-72397-4_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Dooms","year":"2007","unstructured":"Dooms, G., Katriel, I.: The \u201cnot-too-heavy spanning tree\u201d constraint. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 59\u201370. Springer, Heidelberg (2007)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-68155-7_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-C. R\u00e9gin","year":"2008","unstructured":"R\u00e9gin, J.-C.: Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 233\u2013247. Springer, Heidelberg (2008)"},{"issue":"4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: Applications of path compression on balanced trees. Journal of the ACM\u00a026(4), 690\u2013715 (1979)","journal-title":"Journal of the ACM"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. Journal of the ACM\u00a022, 215\u2013225 (1975)","journal-title":"Journal of the ACM"}],"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\/978-3-642-13520-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T15:35:35Z","timestamp":1552577735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}