{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T11:42:02Z","timestamp":1773402122563,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf01192523","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:09:11Z","timestamp":1108728551000},"page":"499-513","source":"Crossref","is-referenced-by-count":46,"title":["Minimizing submodular functions over families of sets"],"prefix":"10.1007","volume":"15","author":[{"given":"M. X.","family":"Goemans","sequence":"first","affiliation":[]},{"given":"V. S.","family":"Ramakrishnan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(87)90097-5","volume":"66","author":"F. Barahona","year":"1987","unstructured":"F. Barahona andM. Conforti: A construction for binary matroids,Discrete Mathematics,66 (1987), 213?218.","journal-title":"Discrete Mathematics"},{"key":"CR2","series-title":"Annals of Discrete Mathematics","volume-title":"Submodular functions and optimization","author":"S. Fujishige","year":"1991","unstructured":"S. Fujishige:Submodular functions and optimization, Annals of Discrete Mathematics 47, North-Holland, Amsterdam, 1991."},{"key":"CR3","unstructured":"H. N. Gabow, M. X. Goemans andD. P. Williamson: An efficient approximation algorithm for the survivable network design problem,Proc. of the Third MPS Integer Programming and Combinatorial Optimization Conference, Erice, Italy, 57?74, 1993."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans andD. P. Williamson: A general approximation technique for constrained forest problems,SIAM Journal on Computing,24 (1995), 296?317. A preliminary version has appeared in theProc. of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, Florida, 307?316, 1992.","journal-title":"SIAM Journal on Computing"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R. E. Gomory","year":"1961","unstructured":"R. E. Gomory andT. C. Hu: Multi-terminal network flows,Journal of the Society for Industrial and Applied Mathematics,9 (1961), 551?570.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\ufffdtschel","year":"1981","unstructured":"M. Gr\ufffdtschel, L. Lov\ufffdsz andA. Schrijver: The ellipsoid method and its consequences in combinatorial optimization.Combinatorica,1 (1981), 169?197.","journal-title":"Combinatorica"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02579139","volume":"4","author":"M. Gr\ufffdtschel","year":"1984","unstructured":"M. Gr\ufffdtschel, L. Lov\ufffdsz andA. Schrijver: Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization,Combinatorica,4 (1984), 291?295.","journal-title":"Combinatorica"},{"key":"CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\ufffdtschel","year":"1988","unstructured":"M. Gr\ufffdtschel, L. Lov\ufffdsz andA. Schrijver:Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming: The State of the Art, Bonn, 1982","author":"L. Lov\ufffdsz","year":"1983","unstructured":"L. Lov\ufffdsz: Submodular functions and convexity, in: A. Bachem, M. Gr\ufffdtschel and B. Korte (eds.),Mathematical Programming: The State of the Art, Bonn, 1982, Springer, Berlin, 235?257, 1983."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"L. Lov\ufffdsz:Combinatorial problems and exercises, Akad\ufffdmiai Kiad\ufffd, 1993.","DOI":"10.1016\/B978-0-444-81504-0.50006-0"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"H. Nagamochi, K. Nishimura andT. Ibaraki: Computing all small cuts in undirected networks,Proceedings of the 5th ISAAC, Beijing, P. R. China, 1994, Lecture Notes in Computer Science,834, D.-Z. Du and X.-S. Zhang, eds., Springer-Verlag, 190?198, 1994.","DOI":"10.1007\/3-540-58325-4_181"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M. W. Padberg","year":"1982","unstructured":"M. W. Padberg andM. R. Rao: Odd minimum cut-sets andb-matchings,Mathematics of Operations Research,7 (1982), 67?80.","journal-title":"Mathematics of Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF01299747","volume":"15","author":"D. Williamson","year":"1995","unstructured":"D. Williamson, M. X. Goemans, M. Mihail andV. Vazirani: An approximation algorithm for general graph connectivity problems,Combinatorica,15 (1995), 435?454.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01192523.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01192523\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01192523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:57:14Z","timestamp":1586120234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01192523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF01192523"],"URL":"https:\/\/doi.org\/10.1007\/bf01192523","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}