{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:12Z","timestamp":1725501072584},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_19","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"209-218","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Bein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Correa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"W. Bartal","year":"2000","unstructured":"Bartal, W., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics\u00a013(1), 64\u201378 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C. Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput.\u00a035(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"key":"19_CR3","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E.G. Coffman","year":"1996","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, Boston (1996)"},{"issue":"5","key":"19_CR4","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ic.2006.02.003","volume":"204","author":"G. D\u00f3sa","year":"2006","unstructured":"D\u00f3sa, G., He, Y.: Bin packing problems with rejection penalties and their dual problems. Information and Computation\u00a0204(5), 795\u2013815 (2006)","journal-title":"Information and Computation"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11970125_12","volume-title":"Approximation and Online Algorithms","author":"L. Epstein","year":"2007","unstructured":"Epstein, L.: Bin packing with rejection revisited. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.\u00a04368, pp. 146\u2013159. Springer, Heidelberg (2007)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W.F. Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.: Bin packing can be solved within 1\u2009+\u2009\u03b5 in linear time. Combinatorica\u00a01, 349\u2013355 (1981)","journal-title":"Combinatorica"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesen","year":"1986","unstructured":"Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM Journal on Computing\u00a015(1), 222\u2013230 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"2-3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H. Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.: Preemptive scheduling with rejection. Mathematical Programming, Ser. B\u00a094(2-3), 361\u2013374 (2003)","journal-title":"Mathematical Programming, Ser. B"},{"key":"19_CR9","first-page":"312","volume-title":"Proc. 23rd Annual IEEE Symp. Found. Comput. Sci.","author":"N. Karmarkar","year":"1982","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proc. 23rd Annual IEEE Symp. Found. Comput. Sci., pp. 312\u2013320. IEEE Computer Society Press, Los Alamitos (1982)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-540-48413-4_6","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"H. Kellerer","year":"1999","unstructured":"Kellerer, H.: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 51\u201362. Springer, Heidelberg (1999)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"F.D. Murgolo","year":"1987","unstructured":"Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing\u00a016(1), 149\u2013161 (1987)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:04Z","timestamp":1619519284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}