{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:50:13Z","timestamp":1767034213346,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181608"},{"type":"electronic","value":"9783319181615"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18161-5_4","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T08:51:26Z","timestamp":1430383886000},"page":"37-45","source":"Crossref","is-referenced-by-count":1,"title":["Belief Propagation for MiniMax Weight Matching"],"prefix":"10.1007","author":[{"given":"Mindi","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Shen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Pavlidis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aji, S.M., Horn, G.B., McEliece, R.J.: On the convergence of iterative decoding on graphs with a single cycle. In: Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, USA, p. 276 (1998)","DOI":"10.1109\/ISIT.1998.708881"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bayati, M., Shah, D., Sharma, M.: Maximum weight matching via max-product belief propagation. In: Proc. IEEE Int. Symp. Information Theory, Cambridge, pp. 1763\u20131767 (2005)","DOI":"10.1109\/ISIT.2005.1523648"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Neely, M., Chugg, K.M.: Iterative message passing algorithm for bipartite maximum weighted matching. In: Proc. IEEE Int. Symp. Information Theory, Cambridge, pp. 1934\u20131938 (2006)","DOI":"10.1109\/ISIT.2006.261818"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Communications of the ACM\u00a051(1), 107\u2013113 (2008)","journal-title":"Communications of the ACM"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/opre.1110.1025","volume":"60","author":"D. Gamarnik","year":"2012","unstructured":"Gamarnik, D., Shah, D., Wei, Y.: Belief propagation for min-cost network flow: Convergence and correctness. Operations Research\u00a060, 410\u2013428 (2012)","journal-title":"Operations Research"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Shor, P.: Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms. In: Proc. of ACM Symposium on Theory of Computing, pp. 91\u2013103 (1986)","DOI":"10.1145\/12130.12140"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"4_CR8","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1214\/aop\/1176990347","volume":"19","author":"P.W. Shor","year":"1991","unstructured":"Shor, P.W., Yukich, J.E.: Minimax grid matching and empirical measures. Ann. Probab.\u00a019, 1338\u20131348 (1991)","journal-title":"Ann. Probab."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/089976600300015880","volume":"12","author":"Y. Weiss","year":"2000","unstructured":"Weiss, Y.: Correctness of local probability propagation in graphical models with loops. Neural Comput.\u00a012, 1\u201342 (2000)","journal-title":"Neural Comput."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Yuan, M., Jiang, C., Li, S., Shen, W., Pavlidis, Y., Li, J.: Message passing algorithm for the generalized assignment problem. In: 11th IFIP International Conf. on Network and Parallel Computing, pp. 423\u2013434 (2014)","DOI":"10.1007\/978-3-662-44917-2_35"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Yuan, M., Shen, W., Li, J., Pavlidis, Y., Li, S.: Auction\/belief propagation algorithms for constrained assignment problem. In: Conf. on Algorithms and Discrete Applied Mathematics, pp. 238\u2013249 (2015)","DOI":"10.1007\/978-3-319-14974-5_23"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18161-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T18:33:03Z","timestamp":1748370783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18161-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181608","9783319181615"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18161-5_4","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}