{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:20Z","timestamp":1725664520047},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_133","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:33:34Z","timestamp":1330292014000},"page":"1-10","source":"Crossref","is-referenced-by-count":5,"title":["Improved bounds for on-line load balancing"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Andrews","sequence":"first","affiliation":[]},{"given":"Michel X.","family":"Goemans","sequence":"additional","affiliation":[]},{"given":"Lisa","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"unstructured":"M. Andrews. Constant factor bounds for on-line load balancing on related machines. Unpublished manuscript, 1995.","key":"1_CR1"},{"doi-asserted-by":"crossref","unstructured":"J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 623\u2013631, 1993.","key":"1_CR2","DOI":"10.1145\/167088.167248"},{"unstructured":"B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 321\u2013330, 1994.","key":"1_CR3"},{"doi-asserted-by":"crossref","unstructured":"Y. Azar, A. Broder, and A. Karlin. On-line load balancing. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 218\u2013225, 1992.","key":"1_CR4","DOI":"10.1109\/SFCS.1992.267770"},{"doi-asserted-by":"crossref","unstructured":"Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. Online load balancing of temporary tasks. In Proceedings of the 1993 Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, pages 119\u2013130. Springer-Verlag, 1993.","key":"1_CR5","DOI":"10.1007\/3-540-57155-8_241"},{"unstructured":"Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 203\u2013210, 1992.","key":"1_CR6"},{"doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 51\u201358, 1992.","key":"1_CR7","DOI":"10.1145\/129712.129718"},{"key":"1_CR8","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":"R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563\u20131581, 1966.","journal-title":"Bell System Technical Journal"},{"unstructured":"D. R. Karger, S. J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 132\u2013140, 1994.","key":"1_CR9"},{"doi-asserted-by":"crossref","unstructured":"S. Phillips and J. Westbrook. Online load balancing and network flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 402\u2013411, 1993.","key":"1_CR10","DOI":"10.1145\/167088.167201"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202\u2013208, 1985.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"J. Westbrook. Load balancing for response time. In Proceedings of the 3rd Annual European Symposium on Algorithms, pages 355\u2013368, 1995.","key":"1_CR12","DOI":"10.1007\/3-540-60313-1_155"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_133.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:30Z","timestamp":1619573490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_133","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}