{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:23:49Z","timestamp":1787509429335,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406716","type":"print"},{"value":"9783540451389","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_44","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"500-510","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling and Traffic Allocation for Tasks with Bounded Splittability"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Krysta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Agarwal, T., Chopra, S., Feldmann, A., Kammenhuber, N., Krysta, P., V\u00f6cking, B.: An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation. To appear in Proc. of the 9th EUROPAR (2003)","DOI":"10.1007\/978-3-540-45209-6_35"},{"key":"44_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.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"issue":"4","key":"44_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Computer and System Science\u00a07(4), 448\u2013461 (1973)","journal-title":"J. Computer and System Science"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Proc. of the 7th ESA, pp. 151\u2013162 (1999)","DOI":"10.1007\/3-540-48481-7_14"},{"key":"44_CR5","doi-asserted-by":"publisher","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. ACM\u00a034, 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing\u00a017, 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.K.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM\u00a023, 317\u2013327 (1976)","journal-title":"J. ACM"},{"key":"44_CR8","volume-title":"Computer networking: a top-down approach featuring the Internet","author":"J.F. Kurose","year":"2001","unstructured":"Kurose, J.F., Ross, K.W.: Computer networking: a top-down approach featuring the Internet. Addison-Wesley, Reading (2001)"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0020-0190(02)00455-6","volume":"86","author":"S.. Kwek","year":"2003","unstructured":"Kwek, S., Mehlhorn, K.: Optimal search for rationals. Information Processing Letters\u00a086, 23\u201326 (2003)","journal-title":"Information Processing Letters"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Science\u00a06, 1\u201312 (1959)","journal-title":"Management Science"},{"key":"44_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(79)90079-6","volume":"8","author":"C.H. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: Efficient search for rationals. Information Processing Letters\u00a08, 1\u20134 (1979)","journal-title":"Information Processing Letters"},{"issue":"4","key":"44_CR12","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s00453-001-0098-3","volume":"32","author":"H. Shachnai","year":"2002","unstructured":"Shachnai, H., Tamir, T.: Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica\u00a032(4), 651\u2013678 (2002)","journal-title":"Algorithmica"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W. Xing","year":"2000","unstructured":"Xing, W., Zhang, J.: Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics\u00a0103, 259\u2013269 (2000)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:54:10Z","timestamp":1559195650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}