{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:00:44Z","timestamp":1725552044013},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_15","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"159-170","source":"Crossref","is-referenced-by-count":2,"title":["On Load-Balanced Semi-matchings for Weighted Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Chor Ping","family":"Low","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall Inc., Englewood Cliffs (1993)"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n2.5 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-45078-8_26","volume-title":"Algorithms and Data Structures","author":"N. Harvey","year":"2003","unstructured":"Harvey, N., Ladner, R., Lovasz, L., Tamir, T.: Semi-matchings for bipartite graphs and load balancing. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 284\u2013306. Springer, Heidelberg (2003)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0020-0190(02)00210-7","volume":"83","author":"C.P. Low","year":"2002","unstructured":"Low, C.P.: An efficient retrival selection algorithm for video servers with random duplicated assignment storage technique. Information Processing Letters\u00a083, 315\u2013321 (2002)","journal-title":"Information Processing Letters"},{"key":"15_CR5","unstructured":"Fakcharoenphol, J., Lekhanukit, B., Nanongkai, D.: A faster algorithm for optimal semi-matching, manuscript (2005)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math.\u00a05, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"15_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman company, New York (1979)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proc. Nat. Acad. Sci.\u00a043, 842\u2013844 (1957)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming\u00a046, 259\u2013271 (1990)","journal-title":"Math. Programming"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44929-9_10","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"E.V. Shchepin","year":"2000","unstructured":"Shchepin, E.V., Vakhania, N.V.: Task distributions on multiprocessor systems. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 112\u2013125. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:23Z","timestamp":1619506583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11750321_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}