{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:15Z","timestamp":1725558375326},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_26","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:23:52Z","timestamp":1277241832000},"page":"294-306","source":"Crossref","is-referenced-by-count":29,"title":["Semi-matchings for Bipartite Graphs and Load Balancing"],"prefix":"10.1007","author":[{"given":"Nicholas J. A.","family":"Harvey","sequence":"first","affiliation":[]},{"given":"Richard E.","family":"Ladner","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Active Directory, http:\/\/www.microsoft.com\/windowsserver2003\/technologies"},{"key":"26_CR2","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, Englewood Cliffs (1993)"},{"key":"26_CR3","unstructured":"Awerbuch, B., Azar, Y., Grove, E., Kao, M.Y., Krishnan, P., Vitter, J.S.: Load Balancing in the Lp Norm. In: Proceedings of FOCS (1995)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms","author":"Y. Azar","year":"1998","unstructured":"Azar, Y.: On-line Load Balancing. In: Fiat, A., Woeginger, G. (eds.) Dagstuhl Seminar 1996. LNCS, ch. 8, vol.\u00a01442. Springer, Heidelberg (1998)"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(94)90153-8","volume":"130","author":"Y. Azar","year":"1994","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R.: On-line load balancing. Theoretical Computer Science\u00a0130(1), 73\u201384 (1994)","journal-title":"Theoretical Computer Science"},{"key":"26_CR6","unstructured":"Azar, Y., Naor, J., Rom, R.: The Competitiveness of On-line Assignments. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA (1992)"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J.L. Bruno","year":"1974","unstructured":"Bruno, J.L., Coffman, E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Communications of the ACM\u00a017, 382\u2013387 (1974)","journal-title":"Communications of the ACM"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Cherkassky, B.V., Goldberg, A.V., Martin, P., Setubal, J.C., Stolfi, J.: Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms. ACM J. Exp. Algorithmics\u00a03(8) (1998), Source code available at http:\/\/www.avglab.com\/andrew\/soft.html","DOI":"10.1145\/297096.297140"},{"key":"26_CR9","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)"},{"key":"26_CR10","first-page":"153","volume":"71","author":"A. Goldberg","year":"1995","unstructured":"Goldberg, A., Kennedy, R.: An efficient cost scaling algorithm for the assignment problem. Math. Prog.\u00a071, 153\u2013178 (1995); Source code available at http:\/\/www.avglab.com\/andrew\/soft.html","journal-title":"Math. Prog."},{"key":"26_CR11","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., Rinnooy 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":"26_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM J. Computing"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/opre.21.3.846","volume":"21","author":"W.A. Horn","year":"1973","unstructured":"Horn, W.A.: Minimizing average flow time with parallel machines. Operations Research\u00a021, 846\u2013847 (1973)","journal-title":"Operations Research"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart.\u00a02, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"key":"26_CR15","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"2001","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Dover, New York (2001)"},{"key":"26_CR16","unstructured":"LEDA, http:\/\/www.algorithmic-solutions.com\/"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:48:23Z","timestamp":1559209703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}