{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:07Z","timestamp":1760202727233},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10107-016-1038-y","type":"journal-article","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T08:21:25Z","timestamp":1467361285000},"page":"241-282","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Graph cuts with interacting edge weights: examples, approximations, and algorithms"],"prefix":"10.1007","volume":"162","author":[{"given":"Stefanie","family":"Jegelka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff A.","family":"Bilmes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,1]]},"reference":[{"key":"1038_CR1","volume-title":"Network Flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Upper Saddle River (1993)"},{"key":"1038_CR2","doi-asserted-by":"crossref","unstructured":"All\u00e8ne, C., Audibert, J.-Y., Couprie, M., Keriven, R.: Some links between extremum spanning forests, watersheds, and min-cuts. Image Vision Comput. 28(10), 1460\u20131471 (2009)","DOI":"10.1016\/j.imavis.2009.06.017"},{"key":"1038_CR3","unstructured":"Bagon, S.: Matlab wrapper for graph cut. http:\/\/www.wisdom.weizmann.ac.il\/~bagon (December 2006)"},{"key":"1038_CR4","unstructured":"Balcan, N., Harvey, N.: Submodular functions: learnability, structure, and optimization. arXiv:1008.2159v3 [cs.DS] (2012)"},{"key":"1038_CR5","doi-asserted-by":"crossref","unstructured":"Baumann, F., Berckey, S., Buchheim, C.: Facets of Combinatorial Optimization\u2014Festschrift for Martin Gr\u00f6tschel, Chapter Exact Algorithms for Combinatorial Optimization Problems with Submodular Objective Functions, pp. 271\u2013294. Springer, New York (2013)","DOI":"10.1007\/978-3-642-38189-8_12"},{"issue":"6","key":"1038_CR6","first-page":"29","volume":"27","author":"J Bilmes","year":"2010","unstructured":"Bilmes, J.: Dynamic graphical models\u2014an overview. IEEE Signal Process. Mag. 27(6), 29\u201342 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"1038_CR7","unstructured":"Bilmes, J., Bartels, C.: On triangulating dynamic graphical models. In: Uncertainty in Artificial Intelligence, pp. 47\u201356. Morgan Kaufmann Publishers, Acapulco, Mexico (2003)"},{"key":"1038_CR8","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: International Conference on Computer Vision (ICCV) (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"issue":"9","key":"1038_CR9","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1038_CR10","volume-title":"Handbook of Mathematical Models in Computer Vision, Chapter Graph Cuts in Vision and Graphics: Theories and Applications","author":"Y Boykov","year":"2006","unstructured":"Boykov, Y., Veksler, O.: Handbook of Mathematical Models in Computer Vision, Chapter Graph Cuts in Vision and Graphics: Theories and Applications. Springer, New York (2006)"},{"key":"1038_CR11","unstructured":"Bunke, F., Hamacher, H.W., Maffioli, F., Schwahn, A.: Minimum cut bases in undirected networks. Report in Wirtschaftsmathematik (WIMA Report) 108, Universit\u00e4t Kaiserslautern (2007)"},{"key":"1038_CR12","doi-asserted-by":"crossref","unstructured":"Chambolle, A., Darbon, J.: On total variation minimization and surface evolution using parametric maximum flows. Int. J. Comput. Vis. 84(3), 288\u2013307 (2009)","DOI":"10.1007\/s11263-009-0238-9"},{"key":"1038_CR13","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Kannan, S., Raja, A., Viswanath, P.: Multicommodity flows and cuts in polymatroidal networks. In: Innovations in Theoretical Computer Science (ITCS) (2012)","DOI":"10.1145\/2090236.2090268"},{"issue":"3","key":"1038_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discret. Appl. Math."},{"key":"1038_CR15","doi-asserted-by":"crossref","unstructured":"Couprie, C., Grady, L., Talbot, H., Najman, L.: Combinatorial continuous maximum flow. SIAM J. Imag. 4(3), 905\u2013930 (2011)","DOI":"10.1137\/100799186"},{"issue":"1","key":"1038_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02579341","volume":"3","author":"WH Cunningham","year":"1983","unstructured":"Cunningham, W.H.: Decomposition of submodular functions. Combinatorica 3(1), 53\u201368 (1983)","journal-title":"Combinatorica"},{"key":"1038_CR17","unstructured":"Dantzig, G., Fulkerson, D.: On the max flow min cut theorem of networks. Technical Report P-826, The RAND Corporation (1955)"},{"key":"1038_CR18","doi-asserted-by":"crossref","unstructured":"Ene, A., Vondr\u00e1k, J., Wu, Y.: Local distribution and the symmetry gap: approximability of multiway partitioning problems. In: Proceedings of SIAM-ACM Symposium on Discrete Algorithms (SODA) (2013)","DOI":"10.1137\/1.9781611973105.23"},{"key":"1038_CR19","doi-asserted-by":"crossref","unstructured":"Fix, A., Joachims, T., Park, S.M., Zabih, R.: Structured learning of sum-of-submodular higher order energy functions. In: International Conference on Computer Vision (ICCV) (2013)","DOI":"10.1109\/ICCV.2013.385"},{"key":"1038_CR20","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L Ford","year":"1956","unstructured":"Ford, L., Fulkerson, D.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"issue":"3","key":"1038_CR21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"1038_CR22","doi-asserted-by":"crossref","unstructured":"Goel, G., Karande, C., Tripati, P., Wang, L.: Approximability of combinatorial problems with multi-agent submodular cost functions. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS) (2009)","DOI":"10.1109\/FOCS.2009.81"},{"key":"1038_CR23","unstructured":"Goel, G., Tripathi, P., Wang, L.: Combinatorial problems with discounted price functions in multi-agent systems. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (2010)"},{"key":"1038_CR24","doi-asserted-by":"crossref","unstructured":"Goemans, M., Harvey, N.J.A., Iwata, S., Mirrokni, V.S.: Approximating submodular functions everywhere. In: Proceedings of SIAM-ACM Symposium on Discrete Algorithms (SODA) (2009)","DOI":"10.1137\/1.9781611973068.59"},{"key":"1038_CR25","unstructured":"Goemans, M.X., Harvey, N.J.A., Kleinberg, R., Mirrokni, V.S.: On learning submodular functions\u2014a preliminary draft. Unpublished Manuscript"},{"key":"1038_CR26","unstructured":"Goyal, V., Ravi, R.: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex domain. Technical Report 366, Tepper School of Business, Carnegie Mellon University (2008)"},{"key":"1038_CR27","unstructured":"Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. R. Stat. Soc. 51(2), 271\u2013279 (1989)"},{"key":"1038_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230120102","volume":"12","author":"R Hassin","year":"1982","unstructured":"Hassin, R.: Minimum cost flow with set constraints. Networks 12, 1\u201321 (1982)","journal-title":"Networks"},{"issue":"4","key":"1038_CR29","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10878-007-9044-x","volume":"14","author":"R Hassin","year":"2007","unstructured":"Hassin, R., Monnot, J., Segev, D.: Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4), 437\u2013453 (2007)","journal-title":"J. Comb. Optim."},{"key":"1038_CR30","doi-asserted-by":"crossref","unstructured":"Heng, L., Gotovos, A., Krause, A., Pollefeys, M.: Efficient visual exploration and coverage with a micro aerial vehicle in unknown environments. In: IEEE International Conference on Robotics and Automation (ICRA) (2015)","DOI":"10.1109\/ICRA.2015.7139309"},{"key":"1038_CR31","doi-asserted-by":"crossref","unstructured":"Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS) (2009)","DOI":"10.1109\/FOCS.2009.31"},{"key":"1038_CR32","unstructured":"Iyer, R., Bilmes, J.: Submodular optimization with submodular cover and submodular knapsack constraints. In: Neural Information Processing Society (NIPS) (2013)"},{"key":"1038_CR33","unstructured":"Iyer, R., Jegelka, S., Bilmes, J.: Fast semidifferential-based submodular function optimization. In: Proceedings of International Conference on Machine Learning (ICML) (2013a)"},{"key":"1038_CR34","unstructured":"Iyer, R., Jegelka, S., Bilmes, J.: Curvature and optimal algorithms for learning and minimizing submodular functions. In: Neural Information Processing Society (NIPS) (2013b)"},{"key":"1038_CR35","unstructured":"Jegelka, S.: Combinatorial Problems with submodular coupling in machine learning and computer vision. PhD thesis, ETH Zurich (2012)"},{"key":"1038_CR36","doi-asserted-by":"crossref","unstructured":"Jegelka, S., Bilmes, J.: Submodularity beyond submodular energies: coupling edges in graph cuts. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2011a)","DOI":"10.1109\/CVPR.2011.5995589"},{"key":"1038_CR37","unstructured":"Jegelka, S., Bilmes, J.: Approximation bounds for inference using cooperative cuts. In: Proceedings of International Conference on Machine Learning (ICML) (2011b)"},{"key":"1038_CR38","unstructured":"Jegelka, S., Lin, H., Bilmes, J.: On fast approximate submodular minimization. In: Neural Information Processing Society (NIPS) (2011)"},{"key":"1038_CR39","unstructured":"Jegelka, S., Bach, F., Sra, S.: Reflection methods for user-friendly submodular optimization. In: Neural Information Processing Society (NIPS) (2013)"},{"key":"1038_CR40","doi-asserted-by":"crossref","unstructured":"Jha, S., Sheyner, O., Wing, J.: Two formal analyses of attack graphs. In: Proceedings of the 15th Computer Security Foundations Workshop, pp. 49\u201363 (2002)","DOI":"10.1109\/CSFW.2002.1021806"},{"key":"1038_CR41","doi-asserted-by":"crossref","unstructured":"Kannan, S., Viswanath, P.: Multiple-unicast in fading wireless networks: a separation scheme is approximately optimal. In: IEEE International Symposium on Information Theory (ISIT) (2011)","DOI":"10.1109\/ISIT.2011.6034044"},{"key":"1038_CR42","doi-asserted-by":"crossref","unstructured":"Kannan, S., Raja, A., Viswanath, P.: Local phy + global flow: a layering principle for wireless networks. In: IEEE International Symposium on Information Theory (ISIT) (2011)","DOI":"10.1109\/ISIT.2011.6033821"},{"key":"1038_CR43","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Dilkina, B., Song, L.: Scalable diffusion-aware optimization of network topology. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1226\u20131235. ACM, New York (2014)","DOI":"10.1145\/2623330.2623704"},{"key":"1038_CR44","doi-asserted-by":"crossref","unstructured":"Kohli, P., Kumar, M., Torr, P.: $$\\text{P}^3$$ P 3 & beyond: move making algorithms for solving higher order functions. IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1645\u20131656 (2009a)","DOI":"10.1109\/TPAMI.2008.217"},{"issue":"3","key":"1038_CR45","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s11263-008-0202-0","volume":"82","author":"P Kohli","year":"2009","unstructured":"Kohli, P., Ladick\u00fd, L., Torr, P.: Robust higher order potentials for enforcing label consistency. Int. J. Comput. Vision 82(3), 302\u2013324 (2009b)","journal-title":"Int. J. Comput. Vision"},{"key":"1038_CR46","doi-asserted-by":"crossref","unstructured":"Kohli, P., Osokin, A., Jegelka, S.: A principled deep random field for image segmentation. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2013)","DOI":"10.1109\/CVPR.2013.257"},{"key":"1038_CR47","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Minimizing a sum of submodular functions. Discret. Appl. Math. 160(15), 2246\u20132258 (2012)","DOI":"10.1016\/j.dam.2012.05.025"},{"key":"1038_CR48","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Boykov, Y.: What metrics can be approximated by geo-cuts, or global optimization of length\/area and flux. In: International Conference on Computer Vision (ICCV) (2005)","DOI":"10.1109\/ICCV.2005.252"},{"issue":"2","key":"1038_CR49","doi-asserted-by":"crossref","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? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1038_CR50","doi-asserted-by":"crossref","unstructured":"Koufogiannakis, C., Young, N.E.: Greedy $$\\Delta $$ \u0394 -approximation algorithm for covering with arbitrary constraints and submodular costs. In: International Colloquium on Automata, Languages and Programming (ICALP) (2009)","DOI":"10.1007\/978-3-642-02927-1_53"},{"key":"1038_CR51","first-page":"1141","volume":"11","author":"A Krause","year":"2010","unstructured":"Krause, A.: SFO: a toolbox for submodular function optimization. J. Mach. Learn. Res. 11, 1141\u20131144 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1038_CR52","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/moor.7.3.334","volume":"7","author":"EL Lawler","year":"1982","unstructured":"Lawler, E.L., Martel, C.U.: Computing maximal \u201cPolymatroidal\u201d network flows. Math. Oper. Res. 7(3), 334\u2013347 (1982)","journal-title":"Math. Oper. Res."},{"key":"1038_CR53","unstructured":"Lin, H., Bilmes, J.: Learning mixtures of submodular shells with application to document summarization. In: Uncertainty in Artificial Intelligence (UAI) (2012)"},{"key":"1038_CR54","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Mathematical Programming\u2014The State of the Art, Chapter Submodular Functions and Convexity, pp. 235\u2013257. Springer, New York (1983)","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"1038_CR55","doi-asserted-by":"crossref","unstructured":"Mittal, S., Schulz, A.: An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. (2012)","DOI":"10.1007\/s10107-011-0511-x"},{"key":"1038_CR56","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"1038_CR57","volume-title":"Submodular Functions and Electrical Networks","author":"H Narayanan","year":"1997","unstructured":"Narayanan, H.: Submodular Functions and Electrical Networks. Elsevier Science, New York (1997)"},{"key":"1038_CR58","doi-asserted-by":"crossref","unstructured":"Nikolova, E.: Approximation algorithms for reliable stochastic combinatorial optimization. In: APPROX (2010)","DOI":"10.1007\/978-3-642-15369-3_26"},{"key":"1038_CR59","first-page":"3","volume":"82","author":"M Queyranne","year":"1998","unstructured":"Queyranne, M.: Minimizing symmetric submodular functions. Math. Program. 82, 3\u201312 (1998)","journal-title":"Math. Program."},{"key":"1038_CR60","doi-asserted-by":"crossref","unstructured":"Ramalingam, S., Kohli, P., Alahari, K., Torr, P.: Exact inference in multi-label CRFs with higher order cliques. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2008)","DOI":"10.1109\/CVPR.2008.4587401"},{"key":"1038_CR61","unstructured":"Ramalingam, S., Russell, C., Ladicky, L., Torr, P.H.S.: Efficient minimization of higher order submodular functions using monotonic boolean functions. arXiv:1109.2304 (2011)"},{"key":"1038_CR62","doi-asserted-by":"crossref","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60, 259\u2013268 (1992)","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"1038_CR63","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2004","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, New York (2004)"},{"key":"1038_CR64","unstructured":"Shelhamer, E., Jegelka, S., Darrell, T.: Communal cuts: sharing cuts across images. In: NIPS Workshop on Discrete Optimization in Machine Learning (2014)"},{"key":"1038_CR65","doi-asserted-by":"crossref","unstructured":"Silberman, N., Shapira, L., Gal, R., Kohli, P.: A contour completion model for augmenting surface reconstructions. In: Europen Conference on Computer Vision (ECCV) (2014)","DOI":"10.1007\/978-3-319-10578-9_32"},{"key":"1038_CR66","doi-asserted-by":"crossref","unstructured":"Sinop, A., Grady, L.: A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In: International Conference on Computer Vision (ICCV) (2007)","DOI":"10.1109\/ICCV.2007.4408927"},{"key":"1038_CR67","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics, Volume\u00a0I of Cambridge Studies in Advanced Mathematics","author":"RP Stanley","year":"1997","unstructured":"Stanley, R.P.: Enumerative Combinatorics, Volume\u00a0I of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (1997)"},{"key":"1038_CR68","unstructured":"Stobbe, P., Krause, A.: Efficient minimization of decomposable submodular functions. In: Neural Information Processing Society (NIPS) (2010)"},{"key":"1038_CR69","unstructured":"Stobbe, P., Krause, A.: Learning Fourier Sparse Set Functions (2012)"},{"key":"1038_CR70","doi-asserted-by":"crossref","unstructured":"Svitkina, Z., Fleischer, L.: Submodular approximation: Sampling-based algorithms and lower bounds. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS) (2008)","DOI":"10.1109\/FOCS.2008.66"},{"key":"1038_CR71","doi-asserted-by":"crossref","unstructured":"Taniai, T., Matsushita, Y., Naemura, T.: Superdifferential cuts for binary energies. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2015)","DOI":"10.1109\/CVPR.2015.7298814"},{"key":"1038_CR72","doi-asserted-by":"crossref","unstructured":"Tardos, E., Tovey, C.A., Trick, M.A.: Layered augmenting path algorithms. Math. Oper. Res. 11(2), 362\u2013370 (1986)","DOI":"10.1287\/moor.11.2.362"},{"key":"1038_CR73","unstructured":"Tschiatschek, S., Iyer, R., Wei, H., Bilmes, J.: Learning mixtures of submodular functions for image collection summarization. In: Neural Information Processing Society (NIPS) (2014)"},{"key":"1038_CR74","unstructured":"Vondr\u00e1k, J.: Submodularity and curvature: the optimal algorithm. RIMS K\u00f4ky\u00fbroku Bessatsu (2008)"},{"issue":"1","key":"1038_CR75","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1137\/110832318","volume":"42","author":"J Vondr\u00e1k","year":"2013","unstructured":"Vondr\u00e1k, J.: Symmetry and approximability of submodular maximization problems. SIAM J. Comput. 42(1), 265\u2013304 (2013)","journal-title":"SIAM J. Comput."},{"key":"1038_CR76","doi-asserted-by":"crossref","unstructured":"Zhang, P., Cai, J.-Y., Tang, L.-Q., Zhao, W.-B.: Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21(2), 192\u2013208 (2011)","DOI":"10.1007\/s10878-009-9222-0"},{"issue":"15","key":"1038_CR77","doi-asserted-by":"crossref","first-page":"3347","DOI":"10.1016\/j.dam.2009.07.001","volume":"157","author":"S Z\u0306ivn\u00fd","year":"2009","unstructured":"Z\u0306ivn\u00fd, S., Cohen, D.A., Jeavons, P.G.: The expressive power of binary submodular functions. Discret. Appl. Math. 157(15), 3347\u20133358 (2009)","journal-title":"Discret. Appl. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1038-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1038-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1038-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1038-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T14:11:12Z","timestamp":1568124672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1038-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,1]]},"references-count":77,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1038"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1038-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,1]]}}}