{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:42:09Z","timestamp":1725511329953},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540005803"},{"type":"electronic","value":"9783540364788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36478-1_7","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:33:12Z","timestamp":1192890792000},"page":"48-63","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection"],"prefix":"10.1007","author":[{"given":"Robert T.","family":"Firla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bianca","family":"Spille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,30]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02591988","volume":"36","author":"C. Brezovec","year":"1986","unstructured":"C. Brezovec, G. Cornuejols, and F. Glover, Two algorithms for weighted matroid intersection, Mathematical Programming 36 (1986), 39\u201353.","journal-title":"Mathematical Programming"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"C. Berge, Two theorems in graph theory, Proc. of the National Academy of Sciences (U.S.A.) 43 (1957), 842\u2013844.","DOI":"10.1073\/pnas.43.9.842"},{"key":"7_CR3","volume-title":"Combinatorial optimization","author":"W.J. Cook","year":"1998","unstructured":"W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver, Combinatorial optimization, Wiley-Interscience, New York, 1998."},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1137\/0402002","volume":"2","author":"P.M. Camerini","year":"1989","unstructured":"P.M. Camerini and H.W. Hamacher, Intersection of two matroids: (condensed) border graphs and ranking, SIAM Journal on Discrete Mathematics 2 (1989), no. 1, 16\u201327.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"7_CR5","unstructured":"J. Edmonds, Matroid partition, Math. Decision Sciences, Proceedings 5th Summer Seminary Stanford 1967, Part 1 (Lectures of Applied Mathematics 11) (1968), 335\u2013345."},{"key":"7_CR6","first-page":"69","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds, Submodular functions, matroids, and certain polyhedra, Combinatorial Structures and their Applications (R. K. Guy, H. Hanai, N. Sauer and J. Sch\u00f6nheim, eds.), Gordon and Brach, New York (1970), 69\u201387."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, Matroids and the greedy algorithm, Mathematical Programming 1 (1971), 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"J. Edmonds, Matroid intersection, Annals of Discrete Mathematics 4 (1979), 39\u201349.","journal-title":"Annals of Discrete Mathematics"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.15807\/jorsj.20.1","volume":"20","author":"S. Fujishige","year":"1977","unstructured":"S. Fujishige, A primal approach to the independent assignment problem, Journal of the Operations Research Society of Japan 20 (1977), 1\u201315.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"7_CR10","unstructured":"M. Gr\u00f6tschel and L. Lov\u00e1sz, Combinatorial optimization, Handbook of Combinatorics (R. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, eds.), North-Holland, Amsterdam, 1995, pp. 1541\u20131598."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall, On representatives of subsets, Journal of the London Mathematical Society 10 (1935), 26\u201330.","journal-title":"Journal of the London Mathematical Society"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"32","DOI":"10.15807\/jorsj.19.32","volume":"19","author":"M. Iri","year":"1976","unstructured":"M. Iri and N. Tomizawa, An algorithm for finding an optimal \u201cindependent assignment\u201d, Journal of the Operations Research Society of Japan 19 (1976), 32\u201357.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"7_CR13","unstructured":"S. Krogdahl, A combinatorial proof of lawler\u2019s matroid intersection algorithm, unpublished manuscript (partly published in [14]) (1975)."},{"key":"7_CR14","volume-title":"Combinatorial optimization: Networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler, Combinatorial optimization: Networks and matroids, Holt, Rinehart and Winston, New York etc., 1976."},{"key":"7_CR15","volume-title":"Primal characterizations of combinatorial optimization problems","author":"B. Spille","year":"2001","unstructured":"B. Spille, Primal characterizations of combinatorial optimization problems, PhD Thesis, University Magdeburg, Germany, 2001."},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/3-540-60313-1_164","volume-title":"Algorithms-ESA95","author":"A.S. Schulz","year":"1995","unstructured":"A.S. Schulz, R. Weismantel, and G.M. Ziegler, 0\/1 integer programming: optimization and augmentation are equivalent, Algorithms-ESA95 (P. Spirakis, ed.), Lecture Notes in Computer Science 979, Springer, Berlin, 1995, pp. 473\u2013483."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization \u2014 Eureka, You Shrink!"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36478-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:02:34Z","timestamp":1556920954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36478-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005803","9783540364788"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36478-1_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}