{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:14Z","timestamp":1725472034614},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_20","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"214-225","source":"Crossref","is-referenced-by-count":5,"title":["A Robust APTAS for the Classical Bin Packing Problem"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms, PWS Publishing Company (1997)","key":"20_CR1"},{"doi-asserted-by":"crossref","unstructured":"Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 147\u2013177 (1998)","key":"20_CR2","DOI":"10.1007\/BFb0029568"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1\u2009+\u2009\u03b5 in linear time. Combinatorica\u00a01, 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02248693","volume":"49","author":"G. Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.J.: Repacking helps in bounded space online bin packing. Computing\u00a049, 329\u2013338 (1993)","journal-title":"Computing"},{"issue":"2","key":"20_CR5","first-page":"151","volume":"4","author":"G. Gambosi","year":"1997","unstructured":"Gambosi, G., Postiglione, A., Talamo, M.: On-line maintenance of an approximate bin-packing solution. Nordic Journal on Computing\u00a04(2), 151\u2013166 (1997)","journal-title":"Nordic Journal on Computing"},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1137\/S0097539799180408","volume":"30","author":"G. Gambosi","year":"2000","unstructured":"Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM Journal on Computing\u00a030(5), 1532\u20131551 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM\u00a034(1), 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0020-0190(97)00092-6","volume":"63","author":"Z. Ivkovic","year":"1997","unstructured":"Ivkovic, Z., Lloyd, E.L.: Partially dynamic bin packing can be solved within 1 + \u03b5 in (amortized) polylogarithmic time. Information Processing Letters\u00a063(1), 45\u201350 (1997)","journal-title":"Information Processing Letters"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1137\/S0097539794276749","volume":"28","author":"Z. Ivkovic","year":"1998","unstructured":"Ivkovic, Z., Lloyd, E.L.: Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM Journal on Computing\u00a028(2), 574\u2013611 (1998)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 312\u2013320 (1982)","key":"20_CR10","DOI":"10.1109\/SFCS.1982.61"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple online bin packing algorithm. Journal of the ACM\u00a032(3), 562\u2013572 (1985)","journal-title":"Journal of the ACM"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/978-3-540-27836-8_92","volume-title":"Automata, Languages and Programming","author":"P. Sanders","year":"2004","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1111\u20131122. Springer, Heidelberg (2004)"},{"key":"20_CR13","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)"},{"issue":"5","key":"20_CR14","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. Journal of the ACM\u00a049(5), 640\u2013671 (2002)","journal-title":"Journal of the ACM"},{"unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)","key":"20_CR15"},{"issue":"5","key":"20_CR16","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 online bin packing algorithms. Information Processing Letters\u00a043(5), 277\u2013284 (1992)","journal-title":"Information Processing Letters"},{"key":"20_CR17","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:32:37Z","timestamp":1558308757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11786986_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}