{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:12Z","timestamp":1725573372211},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_103","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T03:24:24Z","timestamp":1133493864000},"page":"1039-1050","source":"Crossref","is-referenced-by-count":7,"title":["On Efficient Weighted Rectangle Packing with Large Resources"],"prefix":"10.1007","author":[{"given":"Aleksei V.","family":"Fishkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Gerber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"103_CR1","unstructured":"Adler, M., Gibbons, P., Matias, Y.: Scheduling space-sharing for internet advertising. Journal of Scheduling (1998)"},{"key":"103_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":"103_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1137\/0604039","volume":"4","author":"B.S. Baker","year":"1983","unstructured":"Baker, B.S., Calderbank, A.R., Coffman, E.G., Lagarias, J.C.: Approximation algorithms for maximizing the number of squares packed into a rectangle. SIAM Journal on Algebraic and Discrete Methods\u00a04, 383\u2013397 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"103_CR4","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing\u00a09, 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"103_CR5","unstructured":"Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional bin packing. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 189\u2013196 (2004)"},{"key":"103_CR6","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Packing 2-dimensional bins in harmony. In: Proceedings 43rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 490\u2013499 (2002)","DOI":"10.1109\/SFCS.2002.1181973"},{"key":"103_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"F.R.K. Chung","year":"1982","unstructured":"Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods\u00a03, 66\u201376 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"103_CR8","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman Jr.","year":"1980","unstructured":"Coffman Jr., E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing\u00a09, 808\u2013826 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"103_CR9","unstructured":"Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 179\u2013188 (2004)"},{"key":"103_CR10","first-page":"349","volume":"19","author":"C.E. Ferreira","year":"1999","unstructured":"Ferreira, C.E., Miyazawa, F.K., Wakabayashi, Y.: Packing squares into squares. Perquisa Operacional\u00a019, 349\u2013355 (1999)","journal-title":"Perquisa Operacional"},{"key":"103_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-47867-1_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Freund","year":"2002","unstructured":"Freund, A., Naor, J.: Approximating the advertisement placement problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 415\u2013424. Springer, Heidelberg (2002)"},{"key":"103_CR12","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"103_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P.C. Gilmore","year":"1965","unstructured":"Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Operations Research\u00a013, 94\u2013120 (1965)","journal-title":"Operations Research"},{"key":"103_CR14","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0210042","volume":"10","author":"I. Golan","year":"1981","unstructured":"Golan, I.: Performance bounds for orthogonal, oriented two-dimensional packing algorithms. SIAM Journal on Computing\u00a010, 571\u2013582 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"103_CR15","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1137\/S1052623499358689","volume":"41","author":"M.D. Grigoriadis","year":"2001","unstructured":"Grigoriadis, M.D., Khachiyan, L.G., Porkolab, L., Villavicencio, J.: Approximate max-min resource sharing for structured concave optimization. SIAM Journal on Optimization\u00a041, 1081\u20131091 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"103_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-27810-8_27","volume-title":"Algorithm Theory - SWAT 2004","author":"K. Jansen","year":"2004","unstructured":"Jansen, K.: Approximation algorithms for the general max-min resource sharing problem: faster and simpler. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 311\u2013322. Springer, Heidelberg (2004)"},{"key":"103_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-27810-8_31","volume-title":"Algorithm Theory - SWAT 2004","author":"K. Jansen","year":"2004","unstructured":"Jansen, K., Zhang, G.: Maximizing the number of packed rectangles. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 362\u2013371. Springer, Heidelberg (2004)"},{"key":"103_CR18","unstructured":"Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 197\u2013206 (2004)"},{"key":"103_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer, Heidelberg (2004)"},{"key":"103_CR20","doi-asserted-by":"crossref","unstructured":"Kenyon, C., R\u00e9mila, E.: Approximate strip-packing. In: Proceedings 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 31\u201336 (1996)","DOI":"10.1109\/SFCS.1996.548461"},{"key":"103_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. Lawler","year":"1979","unstructured":"Lawler, E.: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research\u00a04, 339\u2013356 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"103_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J.Y.-T. Leung","year":"1990","unstructured":"Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. Journal of Parallel and Distributed Computing\u00a010, 271\u2013275 (1990)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"103_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms - ESA \u201994","author":"I. Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse fit: a 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 290\u2013299. Springer, Heidelberg (1994)"},{"issue":"3","key":"103_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S. Seiden","year":"2003","unstructured":"Seiden, S., van Stee, R.: New bounds for multi-dimentional packing. Algorithmica\u00a036(3), 261\u2013293 (2003)","journal-title":"Algorithmica"},{"key":"103_CR25","doi-asserted-by":"crossref","unstructured":"Sleator, D.D.: A 2.5 times optimal algorithm for bin packing in two dimensions. Informatin Processing Letters\u00a0(10), 37\u201340 (1980)","DOI":"10.1016\/0020-0190(80)90121-0"},{"issue":"2","key":"103_CR26","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_103.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:02:29Z","timestamp":1619492549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11602613_103","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}