{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:26:54Z","timestamp":1725460014328},"publisher-location":"Boston","reference-count":16,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_20","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T10:15:11Z","timestamp":1140516911000},"page":"237-250","source":"Crossref","is-referenced-by-count":3,"title":["On Weighted Rectangle Packing with Large Resources"],"prefix":"10.1007","author":[{"given":"Aleksei V.","family":"Fishkin","sequence":"first","affiliation":[]},{"given":"Olga","family":"Gerber","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Adler, M., Gibbons, P., and Matias, Y. (1998). Scheduling space-sharing for internet advertising. Journal of Scheduling (to appear)."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","volume":"2","author":"B. Baker","year":"1981","unstructured":"Baker, B., Brownand, D., and Katseff, H. (1981). A 5\/4 algorithm for two dimensional packing. J. of Algorithms, 2:348\u2013368.","journal-title":"J. of Algorithms"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0604039","volume":"4","author":"B. Baker","year":"1983","unstructured":"Baker, B., Calderbank, A., Coffman, E., and Lagarias, J. (1983). Approximation algorithms for maximizing the number of squares packed into a rectangle. SIAM Journal on Algebraic and Discrete Methods, 4:383\u2013397.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B. Baker","year":"1980","unstructured":"Baker, B., Coffman, E., and Rivest, R. (1980). Orthogonal packings in two dimensions. SIAM J. Comput., 9:846\u2013855.","journal-title":"SIAM J. Comput."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E. Coffman","year":"1980","unstructured":"Coffman, E., Garey, M., Johnson, D., and Tarjan, R. (1980). Performance bounds for leveloriented two-dimensional packing algorithms. SIAM J. Comput., 9:808\u2013826.","journal-title":"SIAM J. Comput."},{"key":"20_CR6","first-page":"415","volume":"2337","author":"A. Freund","year":"2002","unstructured":"Freund, A. and Naor, J. (2002). Approximating the advertisement placement problem. In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO\u201902), LNCS 2337, pages 415\u2013424.","journal-title":"LNCS"},{"key":"20_CR7","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco, CA."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P. Gilmore","year":"1965","unstructured":"Gilmore, P. and Gomory, R. (1965). Multistage cutting stock problems of two and more dimensions. Operations Research, 13:94\u2013120.","journal-title":"Operations Research"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0210042","volume":"10","author":"I. Golan","year":"1981","unstructured":"Golan, I. (1981). Performance bounds for orthogonal, oriented two-dimensional packing algorithms. SIAM J. Comput., 10:571\u2013582.","journal-title":"SIAM J. Comput."},{"key":"20_CR10","unstructured":"Jansen, K. and Zhang, G. (2004). On rectangle packing: maximizing benefits. In Fifteenth Annual Symposium on Discrete Algorithms, pages 197\u2013206."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., and Pisinger, D. (2004). Knapsack problems. Springer.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Kenyon, C. and Remila, E. (1996). Approximate strip-packing. In Thirty-Seventh Annual Symposium on Foundations of Computer Science, pages 31\u201336.","DOI":"10.1109\/SFCS.1996.548461"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. Lawler","year":"1979","unstructured":"Lawler, E. (1979). Fast approximation algorithms for knapsack problems. Mathematics of Operations Research, 4:339\u2013356.","journal-title":"Mathematics of Operations Research"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Schiermeyer, I. (1994). Reverse fit: a 2-optimal algorithm for packing rectangles. Proceedings 2nd European Symposium on Algorithms, pages 290\u2013299.","DOI":"10.1007\/BFb0049416"},{"key":"20_CR15","unstructured":"Sleator, D. (1980). A 2.5 times optimal algorithm for bin packing in two dimensions. IPL, (10):37\u201340."},{"issue":"2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2):401\u2013409.","journal-title":"SIAM Journal on Computing"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:28:11Z","timestamp":1619540891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_20","relation":{},"subject":[]}}