{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T23:37:37Z","timestamp":1717889857200},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10878-005-5481-6","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:08:53Z","timestamp":1108591733000},"page":"19-34","source":"Crossref","is-referenced-by-count":2,"title":["Average-Case Performance Analysis of a 2D Strip Packing Algorithm?NFDH"],"prefix":"10.1007","volume":"9","author":[{"given":"Xiaodong","family":"Gu","sequence":"first","affiliation":[]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"CR1","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"B.S. Baker, E.G. Coffman, Jr., and R.L. Rivest ?Orthogonal packings in two dimensions?,SIAM J. Comput., vol. 9, no. 4, pp. 846?855, 1980.","journal-title":"SIAM J. Comput."},{"key":"CR2","unstructured":"E.G. Coffman, Jr. and G.S. Lueker ?Packings in twodimensions,? in Probabilistic Analysis of Packing and Partitioning Problems, Wiley, 1991, pp. 155?176."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0377-2217(90)90349-G","volume":"44","author":"E.G. Coffman Jr.","year":"1990","unstructured":"E.G. Coffman, Jr. and P.W. Shor ?Average-case analysis of cutting and packing in two dimensions,? European Journal of Operational Research, vol. 44, pp. 134?144, 1990.","journal-title":"European Journal of Operational Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01190899","volume":"9","author":"E.G. Coffman Jr.","year":"1993","unstructured":"E.G. Coffman, Jr. and P.W. Shor ?Packings in two dimensions: Asymptotic average-case analysis of algorithms,? Algorithmica, vol. 9, pp. 253?277, 1993.","journal-title":"Algorithmica"},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman Jr.","year":"1980a","unstructured":"E.G. Coffman, Jr., M.R. Garey, D.S. Johnson and R.E. Tarjan ?Performance bounds for level-oriented two-dimensional packing algorithms,? SIAM J. Comput., vol. 9, no. 4, pp. 808?826, 1980a.","journal-title":"SIAM J. Comput."},{"key":"CR6","first-page":"46","volume-title":"in Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman","year":"1996","unstructured":"E.G. Coffman, M.R. Garey, and D.S. Johnson ?Approximation algorithms for bin packing: A survey?, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum (Ed.), PWS Publishing: Boston, 1996, pp. 46?93."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(80)90050-9","volume":"44","author":"E.G. Coffman Jr.","year":"1980b","unstructured":"E.G. Coffman, Jr., K. So, M. Hofri, and A.C. Yao ?A stochastic model of bin-packing,? Inf. and Cont., vol. 44, pp. 105?115, 1980b.","journal-title":"Inf. and Cont."},{"key":"CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness., W.H. Freeman and Co.: San Francisco, 1979."},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0210042","volume":"10","author":"I. Golan","year":"1981","unstructured":"I. Golan ?Performance bounds for orthogonal oriented two-dimensional packing algorithms,? SIAM J. Comput., vol. 10, no. 3, pp. 571?582, 1981.","journal-title":"SIAM J. Comput."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"N. Karmarkar ?Probabilistic analysis of some bin-packing algorithms,? in Proceedings of the 23rd Annual Symposium on Foundations of ComputerScience, 1982, pp. 107?111.","DOI":"10.1109\/SFCS.1982.37"},{"key":"CR11","first-page":"369","volume-title":"in Proceedings 10th Symp. on Mathematical Foundations of Computer Science","author":"W. Knodel","year":"1981","unstructured":"W. Knodel ?A bin packing algorithm with complexityO(n log n) and performance 1 in the stochastic limit,? in Proceedings 10th Symp. on Mathematical Foundations of Computer Science, Springer-Verlag: Berlin, 1981, pp. 369?378."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02124678","volume":"9","author":"T. Leighton","year":"1989","unstructured":"T. Leighton and P. Shor ?Tight bounds for minimax grid matching with applications to the average case analysis of algorithms,? Combinatorica, vol. 9, pp. 161?187, 1989.","journal-title":"Combinatorica"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(89)90077-X","volume":"31","author":"P. Ramanan","year":"1989","unstructured":"P. Ramanan ?Average-case analysis of the smart next fit algorithm,? Inf. Proc. Lett., vol. 31, pp. 221?225, 1989.","journal-title":"Inf. Proc. Lett."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1145\/44483.44487","volume":"35","author":"W.T. Rhee","year":"1988","unstructured":"W.T. Rhee and M. Talagrand ?Some distributions that allow perfect packing,? Assoc. Comp. Mach., vol. 35, pp. 564?578, 1988.","journal-title":"Assoc. Comp. Mach."},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02579171","volume":"6","author":"P.W. Shor","year":"1986","unstructured":"P.W. Shor ?The average-case analysis of some on-line algorithms for bin packing,? Combinatorica, vol. 6, no. 2, pp. 179?200, 1986.","journal-title":"Combinatorica"},{"issue":"2","key":"CR16","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"A. Steinberg ?A strip packing algorithm with absolute performance bound 2,? SIAM J. Comput., vol. 26, no. 2, pp. 401?409, 1997.","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5481-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-5481-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5481-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:06:11Z","timestamp":1586117171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-5481-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["5481"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-5481-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}