{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:48:22Z","timestamp":1725828502595},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_38","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"450-458","source":"Crossref","is-referenced-by-count":0,"title":["Node-Balancing by Edge-Increments"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[]},{"given":"Shay","family":"Moran","sequence":"additional","affiliation":[]},{"given":"Rom","family":"Pinchasi","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"issue":"3","key":"38_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","volume":"24","author":"R.P. Anstee","year":"1987","unstructured":"Anstee, R.P.: A polynomial algorithm for b-matchings: an alternative approach. Information Processing Letters\u00a024(3), 153\u2013157 (1987)","journal-title":"Information Processing Letters"},{"issue":"2","key":"38_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(78)90107-3","volume":"23","author":"C. Berge","year":"1978","unstructured":"Berge, C.: Regularisable graphs i. Discrete Mathematics\u00a023(2), 85\u201389 (1978)","journal-title":"Discrete Mathematics"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Cunningham, W.H., Marsh, A.B.: A primal algorithm for optimum matching. In: Polyhedral Combinatorics, pp. 50\u201372. Springer (1978)","DOI":"10.1007\/BFb0121194"},{"key":"38_CR4","doi-asserted-by":"crossref","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. Journal of Research of the National Bureau of Standards\u00a069, 125\u2013130 (1965)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"38_CR6","unstructured":"Harold, N.: Gabow. Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434\u2013443. Society for Industrial and Applied Mathematics (1990)"},{"issue":"4","key":"38_CR7","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H.N. Gabow","year":"1991","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. Journal of the ACM (JACM)\u00a038(4), 815\u2013853 (1991)","journal-title":"Journal of the ACM (JACM)"},{"key":"38_CR8","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0927-0507(05)80120-3","volume-title":"Network Models","author":"A.M.H. Gerards","year":"1995","unstructured":"Gerards, A.M.H.: Matching. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol.\u00a07, pp. 135\u2013224. North-Holland, Amsterdam (1995)"},{"issue":"4","key":"38_CR9","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"A.V. Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM\u00a036(4), 873\u2013886 (1989)","journal-title":"J. ACM"},{"issue":"4","key":"38_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n^5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, NY (1972)"},{"key":"38_CR12","first-page":"81","volume":"5","author":"A.V. Karzanov","year":"1973","unstructured":"Karzanov, A.V.: On finding a maximum flow in a network with special structure and some applications. Matematicheskie Voprosy Upravleniya Proizvodstvom\u00a05, 81\u201394 (1973)","journal-title":"Matematicheskie Voprosy Upravleniya Proizvodstvom"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Madry, A.: Navigating central path with electrical flows: From flows to matchings, and back. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 253\u2013262. IEEE (2013)","DOI":"10.1109\/FOCS.2013.35"},{"issue":"4","key":"38_CR14","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res.\u00a04(4), 414\u2013424 (1979)","journal-title":"Math. Oper. Res."},{"key":"38_CR15","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial optimization. Polyhedra and efficiency (3 volumes)","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency (3 volumes). Algorithms and Combinatorics, vol.\u00a024. Springer, Berlin (2003)"},{"issue":"3","key":"38_CR16","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W.T. Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Canad. J. Math.\u00a04(3), 314\u2013328 (1952)","journal-title":"Canad. J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T01:38:13Z","timestamp":1567129093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}