{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:01Z","timestamp":1725586801721},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_32","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T13:58:49Z","timestamp":1308405529000},"page":"404-416","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Matching Forests and Valuated Delta-Matroids"],"prefix":"10.1007","author":[{"given":"Kenjiro","family":"Takazawa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02604639","volume":"38","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Greedy Algorithm and Symmetric Matroids. Math. Programming\u00a038, 147\u2013159 (1987)","journal-title":"Math. Programming"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(92)90272-C","volume":"24","author":"A. Bouchet","year":"1989","unstructured":"Bouchet, A.: Matchings and \u0394-Matroids. Discrete Appl. Math.\u00a024, 55\u201362 (1989)","journal-title":"Discrete Appl. Math."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(88)90101-X","volume":"71","author":"R. Chandrasekaran","year":"1988","unstructured":"Chandrasekaran, R., Kabadi, S.N.: Pseudomatroids. Discrete Math.\u00a071, 205\u2013217 (1988)","journal-title":"Discrete Math."},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0121194","volume":"8","author":"W.H. Cunningham","year":"1978","unstructured":"Cunningham, W.H., Marsh III, A.B.: A Primal Algorithm for Optimum Matching. Math. Programming Study\u00a08, 50\u201372 (1978)","journal-title":"Math. Programming Study"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0001-8708(86)90104-0","volume":"62","author":"A.W.M. Dress","year":"1986","unstructured":"Dress, A.W.M., Havel, T.: Some Combinatorial Properties of Discriminants in Metric Vector Spaces. Adv. Math.\u00a062, 285\u2013312 (1986)","journal-title":"Adv. Math."},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0893-9659(91)90075-7","volume":"4","author":"A.W.M. Dress","year":"1991","unstructured":"Dress, A.W.M., Wenzel, W.: A Greedy-Algorithm Characterization of Valuated \u0394-matroids. Appl. Math. Lett.\u00a04, 55\u201358 (1991)","journal-title":"Appl. Math. Lett."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum Matching and a Polyhedron with 0,1-Vertices. J. Res. Natl. Bur. Stand. Sect.\u00a0B\u00a069, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stand. Sect.\u00a0B"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, Trees, and Flowers. Canad. J. Math.\u00a017, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum Branchings. J. Res. Natl. Bur. Stand. Sect. B\u00a071, 233\u2013240 (1967)","journal-title":"J. Res. Natl. Bur. Stand. Sect. B"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"Edmonds, J., Giles, R.: A Min-Max Relation for Submodular Functions on Graphs. Ann. Discrete Math.\u00a01, 185\u2013204 (1977)","journal-title":"Ann. Discrete Math."},{"key":"32_CR11","first-page":"77","volume":"41","author":"A. Frank","year":"1979","unstructured":"Frank, A.: Covering Branchings. Acta Sci. Math (Szeged)\u00a041, 77\u201381 (1979)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BF01589418","volume":"42","author":"A. Frank","year":"1988","unstructured":"Frank, A., Tardos, \u00c9.: Generalized Polymatroids and Submodular Flows. Math. Programming\u00a042, 489\u2013563 (1988)","journal-title":"Math. Programming"},{"key":"32_CR13","unstructured":"Gabow, H.N.: Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs, Ph.D. thesis, Stanford University (1973)"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01581022","volume":"22","author":"R. Giles","year":"1982","unstructured":"Giles, R.: Optimum Matching Forests I: Special Weights. Math. Programming\u00a022, 1\u201311 (1982)","journal-title":"Math. Programming"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BF01581023","volume":"22","author":"R. Giles","year":"1982","unstructured":"Giles, R.: Optimum Matching Forests II: General Weights. Math. Programming\u00a022, 12\u201338 (1982)","journal-title":"Math. Programming"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01581024","volume":"22","author":"R. Giles","year":"1982","unstructured":"Giles, R.: Optimum Matching Forests III: Facets of Matching Forest Polyhedra. Math. Programming\u00a022, 39\u201351 (1982)","journal-title":"Math. Programming"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0012-365X(02)00671-4","volume":"260","author":"J. Keijsper","year":"2003","unstructured":"Keijsper, J.: A Vizing-Type Theorem for Matching Forests. Discrete Math.\u00a0260, 211\u2013216 (2003)","journal-title":"Discrete Math."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid Matching and Some Applications. J. Combin. Theory Ser.\u00a0B\u00a028, 208\u2013236 (1980)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"key":"32_CR19","first-page":"565","volume":"40","author":"K. Murota","year":"1997","unstructured":"Murota, K.: Characterizing a Valuated Delta-Matroid as a Family of Delta-Matroids. J. Oper. Res. Soc. Japan\u00a040, 565\u2013578 (1997)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"32_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"K. Murota","year":"2003","unstructured":"Murota, K.: Discrete Convex Analysis. SIAM, Philadelphia (2003)"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s004930070009","volume":"20","author":"A. Schrijver","year":"2000","unstructured":"Schrijver, A.: Total Dual Integrality of Matching Forest Constraint. Combinatorica\u00a020, 575\u2013588 (2000)","journal-title":"Combinatorica"},{"key":"32_CR22","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization\u2014Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"32_CR23","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: Ob Otsenke Khromaticheskogo Klassa p-grapha (in Russian). Diskretny\u012d\u00a03, 25\u201330 (1964)","journal-title":"Diskretny\u012d"},{"issue":"3","key":"32_CR24","first-page":"29","volume":"1","author":"V.G. Vizing","year":"1965","unstructured":"Vizing, V.G.: Khromaticheski\u012d Klass Mul\u2019tigrafa (in Russian). Kibernetika\u00a01(3), 29\u201339 (1965)","journal-title":"Kibernetika"},{"key":"32_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0893-9659(93)90103-T","volume":"6","author":"W. Wenzel","year":"1993","unstructured":"Wenzel, W.: \u0394-Matroids with the Strong Exchange Conditions. Appl. Math. Lett.\u00a06, 67\u201370 (1993)","journal-title":"Appl. Math. Lett."},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(93)90494-E","volume":"115","author":"W. Wenzel","year":"1993","unstructured":"Wenzel, W.: Pfaffian Forms and \u0394-Matroids. Discrete Math.\u00a0115, 253\u2013266 (1993)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T02:08:08Z","timestamp":1553825288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}