{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:20:07Z","timestamp":1740374407617,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210795"},{"type":"electronic","value":"9783540245926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24592-6_5","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:13:33Z","timestamp":1280387613000},"page":"53-66","source":"Crossref","is-referenced-by-count":1,"title":["Load Balancing of Temporary Tasks in the \u2113 p Norm"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S. Albers","year":"1999","unstructured":"Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing\u00a029, 459\u2013473 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01(1), 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s004530010051","volume":"29","author":"A. Avidor","year":"2001","unstructured":"Avidor, A., Azar, Y., Sgall, J.: Ancient and new algorithms for load balancing in the ${\\it l_p}$ norm. Algorithmica\u00a029, 422\u2013441 (2001); Also in Proc. 9th ACM-SIAMSODA, pp. 426\u2013435 (1998)","journal-title":"Algorithmica"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, L.: On-line load balancing of temporary tasks on identical machines. In: 5th Israeli Symp. on Theory of Computing and Systems, pp. 119\u2013125 (1997)","DOI":"10.1109\/ISTCS.1997.595163"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/S0304-3975(01)00254-7","volume":"287","author":"Y. Azar","year":"2002","unstructured":"Azar, Y., Regev, O., Sgall, J., Woeginger, G.: Off-line temporary tasks assignment. Theoretical Computer Science\u00a0287, 419\u2013428 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences\u00a051(3), 359\u2013366 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y. Bartal","year":"1994","unstructured":"Bartal, Y., Karloff, H., Rabani, Y.: A better lower bound for on-line scheduling. Information Processing Letters\u00a050, 113\u2013116 (1994)","journal-title":"Information Processing Letters"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/0204021","volume":"4","author":"A.K. Chandra","year":"1975","unstructured":"Chandra, A.K., Wong, C.K.: Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing\u00a04(3), 249\u2013263 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR9","first-page":"107","volume":"9","author":"U. Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., Turan, G.: On the performance of online algorithms for partition problems. Acta Cybernetica\u00a09, 107\u2013119 (1989)","journal-title":"Acta Cybernetica"},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling\u00a03(5), 343\u2013353 (2000)","journal-title":"Journal of Scheduling"},{"key":"5_CR11","unstructured":"Gormley, T., Reingold, N., Torng, E., Westbrook, J.: Generating adversaries for request-answer games. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 564\u2013565 (2000)"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math\u00a017, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math"},{"issue":"1","key":"5_CR14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. Assoc. Comput. Mach.\u00a034(1), 144\u2013162 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"5_CR15","unstructured":"Rudin III., J.F.: Improved bounds for the on-line scheduling problem. PhD thesis, The University of Texas at Dallas (May 2001)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"D. Karger","year":"1996","unstructured":"Karger, D., Phillips, S., Torng, E.: A better algorithm for an ancient scheduling problem. Journal of Algorithms\u00a020(2), 400\u2013430 (1996)","journal-title":"Journal of Algorithms"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(95)00099-X","volume":"56","author":"J.Y.T. Leung","year":"1995","unstructured":"Leung, J.Y.T., Wei, W.D.: Tighter bounds on a heuristic for a partition problem. Information Processing Letters\u00a056, 51\u201357 (1995)","journal-title":"Information Processing Letters"},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery\u00a023, 116\u2013127 (1976)","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24592-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T15:16:55Z","timestamp":1740323815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24592-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210795","9783540245926"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24592-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}