{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:21Z","timestamp":1725567081586},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_89","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"885-894","source":"Crossref","is-referenced-by-count":0,"title":["Bin Packing and Covering Problems with Rejection"],"prefix":"10.1007","author":[{"given":"Yong","family":"He","sequence":"first","affiliation":[]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"89_CR1","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S.B. Assman","year":"1984","unstructured":"Assman, S.B., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On the dual of one-dimensional bin-packing problem. J. of Algorithms\u00a05, 502\u2013525 (1984)","journal-title":"J. of Algorithms"},{"unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms for NP-hard problems, pp. 46\u201393. PWS Publishing (1997)","key":"89_CR2"},{"unstructured":"Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: Proc. of SIAM Conference on Discrete Algorithms, Washington, DC, pp. 557\u2013566 (2001)","key":"89_CR3"},{"key":"89_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(88)90052-2","volume":"21","author":"J. Csirik","year":"1988","unstructured":"Csirik, J., Totik, V.: On-line algorithms for a dual version of bin packing. Discrete Applied Mathematics\u00a021, 163\u2013167 (1988)","journal-title":"Discrete Applied Mathematics"},{"key":"89_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online Algorithms","author":"J. Csirik","year":"1998","unstructured":"Csirik, J., Woeginger, G.: On-line packing and covering problems. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442, pp. 147\u2013177. Springer, Heidelberg (1998)"},{"key":"89_CR6","first-page":"51","volume":"21","author":"W. Chen","year":"1999","unstructured":"Chen, W., Yang, J., Lu, D., Pan, Y.: Two mathematical models and algorithms of internet communications. Chinese J. Computers\u00a021, 51\u201355 (1999) (in Chinese)","journal-title":"Chinese J. Computers"},{"key":"89_CR7","volume-title":"Computer and Intractability: A Guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the theory of NP-Completeness. Freeman, New York (1979)"},{"key":"89_CR8","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0304-3975(03)00363-3","volume":"306","author":"K. Jansen","year":"2003","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theoretical Computer Science\u00a0306, 543\u2013551 (2003)","journal-title":"Theoretical Computer Science"},{"key":"89_CR9","doi-asserted-by":"publisher","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., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. on Computing\u00a03, 299\u2013325 (1974)","journal-title":"SIAM J. on Computing"},{"doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the onedimensional bin packing problem. In: Proc. 23rd Annual Symposium on Foundations of Computer Science, Chicago, pp. 312\u2013320 (1982)","key":"89_CR10","DOI":"10.1109\/SFCS.1982.61"},{"key":"89_CR11","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. of the ACM\u00a049, 640\u2013671 (2002)","journal-title":"J. of the ACM"},{"key":"89_CR12","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problemma. Naval Research Logistics\u00a041, 579\u2013585 (1994)","journal-title":"Naval Research Logistics"},{"key":"89_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A. Vliet Van","year":"1992","unstructured":"Van Vliet, A.: An improved lower bound for on-line bin packing algorithms, Information. Processing Letters\u00a043, 277\u2013284 (1992)","journal-title":"Processing Letters"},{"key":"89_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-27796-5_25","volume-title":"Structural Information and Communication Complexity","author":"D. Ye","year":"2004","unstructured":"Ye, D., Zhang, G.: On-line scheduling of parallel jobs. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 279\u2013290. Springer, Heidelberg (2004)"},{"key":"89_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0167-6377(99)00077-2","volume":"26","author":"G.C. Zhang","year":"1999","unstructured":"Zhang, G.C., Cai, X.Q., Wong, C.K.: Linear-time approximation algorithms for bin packing problem. Operations Research Letters\u00a026, 217\u2013222 (1999)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T18:37:14Z","timestamp":1586457434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11533719_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}