{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:36:29Z","timestamp":1648528589304},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553906","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T18:07:35Z","timestamp":1114020455000},"page":"519-533","source":"Crossref","is-referenced-by-count":6,"title":["Average-case analysis of the Modified Harmonic algorithm"],"prefix":"10.1007","volume":"4","author":[{"given":"Prakash","family":"Ramanan","sequence":"first","affiliation":[]},{"given":"Kazuhiro","family":"Tsuga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01553906_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"Angluin, D., and Valiant, L. G., Fast probabilistic algorithms for Hamiltonian paths and matchings,3. Comput. System Sci. 18 (1979), 155\u2013193.","journal-title":"3. Comput. System Sci."},{"key":"BF01553906_CR2","doi-asserted-by":"crossref","unstructured":"Bentley, J. L., Johnson, D. S., Leighton, F. T., McGeoch, C. C., and McGeoch, L. A., Some unexpected expected behavior results for bin packing,Proc. 16th Ann. ACM Symp. on Theory of Computing, May 1984, pp. 279\u2013288.","DOI":"10.1145\/800057.808692"},{"key":"BF01553906_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H., A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,Ann. of Math. Statist. 23 (1952), 493\u2013507.","journal-title":"Ann. of Math. Statist."},{"key":"BF01553906_CR4","volume-title":"Algorithm Design for Computer System Design","author":"E. G. Coffman Jr.","year":"1984","unstructured":"Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., Approximation algorithms for bin packing\u2014an updated survey, inAlgorithm Design for Computer System Design, G. Ausiello, M. Lucertini, and P. Serafini, editors, Springer-Verlag, New York, 1984."},{"key":"BF01553906_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(80)90050-9","volume":"44","author":"E. G. Coffman Jr.","year":"1980","unstructured":"Coffman, E. G., Jr., So, K., Hofri, M., and Yao, A. C., A stochastic model of bin packing,Inform, and Control 44 (1980), 105\u2013115.","journal-title":"Inform, and Control"},{"key":"BF01553906_CR6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0020-0190(80)90041-1","volume":"11","author":"G. N. Frederickson","year":"1980","unstructured":"Frederickson, G. N., Probabilistic analysis for simple one- and two-dimensional bin-packing algorithms,Inform. Process. Lett. 11 (1980), 156\u2013161.","journal-title":"Inform. Process. Lett."},{"key":"BF01553906_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.,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"BF01553906_CR8","volume-title":"Near-optimal bin-packing algorithms, Technical Report MAC TR-109, Project MAC","author":"D. S. Johnson","year":"1973","unstructured":"Johnson, D. S., Near-optimal bin-packing algorithms, Technical Report MAC TR-109, Project MAC, Massachusetts Institute of Technology, Cambridge, MS, 1973."},{"key":"BF01553906_CR9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L., Worst-case performance bounds for simple one-dimensional packing algorithms,SIAMJ. Comput. 3 (1974), 299\u2013325.","journal-title":"SIAMJ. Comput."},{"key":"BF01553906_CR10","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Probabilistic analysis of some bin-packing problems,Proc. 23rd Ann. IEEE Symp. on Foundations of Computer Science, November 1982, pp. 107\u2013111.","DOI":"10.1109\/SFCS.1982.37"},{"key":"BF01553906_CR11","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., and Karp, R. M., An efficient approximation scheme for the one-dimensional bin-packing problem,Proc. 23rd Ann. IEEE Symp. on Foundations of Computer Science, November 1982, pp. 312\u2013320.","DOI":"10.1109\/SFCS.1982.61"},{"key":"BF01553906_CR12","volume-title":"A new algorithm for one-line bin packing, Technical Report 83-03-FC-02, Department of Electrical Engineering and Computer Science","author":"C. C. Lee","year":"1983","unstructured":"Lee, C. C., and Lee, D. T., A new algorithm for one-line bin packing, Technical Report 83-03-FC-02, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 1983."},{"key":"BF01553906_CR13","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C. C. Lee","year":"1985","unstructured":"Lee, C. C., and Lee, D. T., A simple on-line packing algorithm,J. Assoc. Comput. Mach. 32 (1985), 562\u2013572.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01553906_CR14","doi-asserted-by":"crossref","unstructured":"Ramanan, P., Brown, D. J., Lee, C. C., and Lee, D. T., On-line bin packing in linear time,J. Algorithms, submitted.","DOI":"10.1016\/0196-6774(89)90031-X"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553906.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553906\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:21:13Z","timestamp":1556878873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553906"],"URL":"https:\/\/doi.org\/10.1007\/bf01553906","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}