{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:27:02Z","timestamp":1725560822627},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_8","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:13:33Z","timestamp":1280387613000},"page":"95-108","source":"Crossref","is-referenced-by-count":0,"title":["A $\\frac{5}{4}$ -Approximation Algorithm for Scheduling Identical Malleable Tasks"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Decker","sequence":"first","affiliation":[]},{"given":"Thomas","family":"L\u00fccking","sequence":"additional","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B. Baker","year":"1980","unstructured":"Baker, B., Coffman, E., Rivest, R.: Orthogonal packings in two dimensions. SIAM Journal on Computing\u00a09(4), 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","volume":"2","author":"B.S. Baker","year":"1981","unstructured":"Baker, B.S., Brown, D.J., Katseff, H.P.: A 5\/4 algorithm for two-dimensional packing. Journal of Algorithms\u00a02, 348\u2013368 (1981)","journal-title":"Journal of Algorithms"},{"key":"8_CR3","unstructured":"Belkhale, K.P., Banerjee, P.: Partitionable independent task scheduling problem. In: Proc. of the 1990 International Conference on Parallel Processing (ICPP 1990), vol.\u00a01, pp. 72\u201375 (1990)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-44681-8_29","volume-title":"Euro-Par 2001 Parallel Processing","author":"J. Blazewicz","year":"2001","unstructured":"Blazewicz, J., Machowiak, M., Mouni\u00e9, G., Trystram, D.: Approximation algorithms for scheduling independent malleable tasks. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol.\u00a02150, pp. 191\u2013197. Springer, Heidelberg (2001)"},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03088-2","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"1995","unstructured":"Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (1995)"},{"key":"8_CR6","first-page":"98","volume":"82","author":"W. Fernandez de la Vega","year":"1998","unstructured":"Fernandez de la Vega, W., Zissimopoulos, V.: An approximation scheme for strip packing of rectangles with bounded dimensions. Discrete Applied Mathematics\u00a082, 98\u2013101 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR7","unstructured":"Decker, T.: Ein universelles Lastverteilungssystem und seine Anwendung bei der Isolierung reeller Nullstellen. Dissertation (2000)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-46642-0_38","volume-title":"High Performance Computing \u2013 HiPC\u201999","author":"T. Decker","year":"1999","unstructured":"Decker, T., Krandick, W.: Parallel real root isolation using the descartes method. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds.) HiPC 1999. LNCS, vol.\u00a01745, pp. 261\u2013268. Springer, Heidelberg (1999)"},{"key":"8_CR9","unstructured":"Decker, T., L\u00fccking, T., Monien, B.: A 5\/4-approximation algorithm for scheduling identical malleable tasks. Technical report, tr-rsfb-02-071, University of Paderborn (2002)"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J., Leung, Y.-T.: Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics\u00a02(4), 473\u2013487 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research\u00a044, 145\u2013159 (1990)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"M. Garey","year":"1975","unstructured":"Garey, M., Graham, R.: Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing\u00a04(2), 187\u2013200 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/3-540-45749-6_50","volume-title":"Algorithms - ESA 2002","author":"K. Jansen","year":"2002","unstructured":"Jansen, K.: Scheduling malleable parallel tasks: An asymptotic fully polynomialtime approximation scheme. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 562\u2013573. Springer, Heidelberg (2002)"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-001-0085-8","volume":"32","author":"K. Jansen","year":"2002","unstructured":"Jansen, K., Porkolab, L.: Linear time approximation schemes for scheduling malleable parallel tasks. Algorithmica\u00a032(3), 507\u2013520 (2002)","journal-title":"Algorithmica"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Remila, E.: Approximate strip packing. In: Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 142\u2013154 (1996)","DOI":"10.1109\/SFCS.1996.548461"},{"key":"8_CR16","unstructured":"Khanna, S., Muthukrishnan, S., Paterson, M.: On approximating rectangular tiling and packing. In: Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 384\u2013393 (1998)"},{"key":"8_CR17","unstructured":"Krishnamurti, R., Ma, E.: The processor partitioning problem in special-purpose partitionable systems. In: Proc. of the 1988 International Conference on Parallel Processing (ICPP 1988), vol.\u00a01, pp. 434\u2013443 (1988)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Mouni\u00e9, G., Rapine, C., Trystram, D.: Efficient approximation algorithms for scheduling malleable tasks. In: Proc. of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1999), pp. 23\u201332 (1999)","DOI":"10.1145\/305619.305622"},{"key":"8_CR19","unstructured":"Mouni\u00e9, G., Rapine, C., Trystram, D.: A $\\frac{3}{2}$ -approximation algorithm for independent scheduling malleable tasks (2001) (submitted for publication)"},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing\u00a026(2), 401\u2013409 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms for scheduling parallelizable tasks. In: Proc. of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1992), pp. 323\u2013332 (1992)","DOI":"10.1145\/140901.141909"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","volume":"16","author":"B. Veltman","year":"1990","unstructured":"Veltman, B., Lageweg, B.J., Lenstra, J.K.: Multiprocessor scheduling with communication delays. Parallel Computing\u00a016, 173\u2013182 (1990)","journal-title":"Parallel Computing"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:38:02Z","timestamp":1559345882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24592-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210795","9783540245926"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24592-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}