{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:19:37Z","timestamp":1744258777233,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642337178"},{"type":"electronic","value":"9783642337185"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-33718-5_28","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T08:06:45Z","timestamp":1348646805000},"page":"385-398","source":"Crossref","is-referenced-by-count":4,"title":["Approximate MRF Inference Using Bounded Treewidth Subgraphs"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Fix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joyce","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Endre","family":"Boros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramin","family":"Zabih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Applied Mathematics 123 (2002)","key":"28_CR1","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/TPAMI.2007.1031","volume":"29","author":"V. Kolmogorov","year":"2007","unstructured":"Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cuts-a review. TPAMI\u00a029, 1274\u20131279 (2007); Earlier version appears as technical report MSR-TR-2006-100","journal-title":"TPAMI"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.disopt.2007.02.001","volume":"5","author":"E. Boros","year":"2008","unstructured":"Boros, E., Hammer, P., Sun, R., Tavares, G.: A max-flow approach to improved lower bounds for quadratic 0\u2009\u2212\u20091 minimization. Discrete Optimization\u00a05, 501\u2013529 (2008); Also appeared as 2006 RUTCOR technical report","journal-title":"Discrete Optimization"},{"doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Lempitsky, V., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: CVPR (2007)","key":"28_CR4","DOI":"10.1109\/CVPR.2007.383203"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1109\/TPAMI.2009.131","volume":"31","author":"O. Woodford","year":"2009","unstructured":"Woodford, O., Torr, P., Reid, I., Fitzgibbon, A.: Global stereo reconstruction under second-order smoothness priors. TPAMI\u00a031, 2115\u20132128 (2009)","journal-title":"TPAMI"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R. Szeliski","year":"2008","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for Markov Random Fields. TPAMI\u00a030, 1068\u20131080 (2008)","journal-title":"TPAMI"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? TPAMI\u00a026, 147\u2013159 (2004)","journal-title":"TPAMI"},{"unstructured":"Boros, E., Hammer, P.: A max-flow approach to improved roof-duality in quadratic 0 \u2212 1 minimization. Technical report, RUTCOR (1989)","key":"28_CR8"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. TPAMI\u00a023, 1222\u20131239 (2001)","journal-title":"TPAMI"},{"doi-asserted-by":"crossref","unstructured":"Hammer, P., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer (1968)","key":"28_CR10","DOI":"10.1007\/978-3-642-85823-9"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P. Hammer","year":"1965","unstructured":"Hammer, P.: Some network flow problems solved with pseudo-boolean programming. Operations Research\u00a013, 388\u2013399 (1965)","journal-title":"Operations Research"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P.L. Hammer","year":"1984","unstructured":"Hammer, P.L., Hansen, P., Simeone, B.: Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematical Programming\u00a028, 121\u2013155 (1984)","journal-title":"Mathematical Programming"},{"doi-asserted-by":"crossref","unstructured":"Feige, U., Goemans, M.: Approximating the value of two power proof systems, with applications to max 2sat and max dicut. In: 3rd Israel Symposium on the Theory of Computing Systems, p. 182 (1995)","key":"28_CR13","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T. Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discrete Applied Mathematics\u00a04, 47\u201374 (1982)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F. Harary","year":"1953","unstructured":"Harary, F.: On the notion of balance of a signed graph. Michigan Mathematical Journal\u00a02, 143\u2013146 (1953)","journal-title":"Michigan Mathematical Journal"},{"key":"28_CR16","first-page":"69","volume":"36","author":"P.L. Hammer","year":"1977","unstructured":"Hammer, P.L.: Pseudo-boolean remarks on balanced graphs. International Series of Numerical Mathematics\u00a036, 69\u201378 (1977)","journal-title":"International Series of Numerical Mathematics"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W. H. Freeman and Company (1979)","key":"28_CR18"},{"key":"28_CR19","volume-title":"Graphical Models, Exponential Families, and Variational Inference","author":"M.J. Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I.: Graphical Models, Exponential Families, and Variational Inference. Now Publishers Inc., Hanover (2008)"},{"doi-asserted-by":"crossref","unstructured":"Lipton, R., Tarjan, R.: Applications of a planar separator theorem. SIAM Journal on Computing, 615\u2013627 (1980)","key":"28_CR20","DOI":"10.1137\/0209046"},{"unstructured":"Karger, D.R., Srebro, N.: Learning markov networks: maximum bounded tree-width graphs. In: SODA, pp. 392\u2013401 (2001)","key":"28_CR21"},{"unstructured":"Shahaf, D., Chechetka, A., Guestrin, C.: Learning thin junction trees via graph cuts. In: Artificial Intelligence and Statistics, AISTATS (2009)","key":"28_CR22"},{"unstructured":"Mooij, J.M.: libDAI: A free & open source C++ library for Discrete Approximate Inference in graphical models. Journal of Machine Learning Research 11 (August 2010)","key":"28_CR23"},{"doi-asserted-by":"crossref","unstructured":"Raj, A., Zabih, R.: A graph cut algorithm for generalized image deconvolution. In: International Conference on Computer Vision, ICCV (2005)","key":"28_CR24","DOI":"10.1109\/ICCV.2005.8"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33718-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T14:06:45Z","timestamp":1744207605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33718-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337178","9783642337185"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33718-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}