{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:00:27Z","timestamp":1761292827072},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,7,9]],"date-time":"2011-07-09T00:00:00Z","timestamp":1310169600000},"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":[[2013,10]]},"DOI":"10.1007\/s10878-011-9408-0","type":"journal-article","created":{"date-parts":[[2011,7,8]],"date-time":"2011-07-08T18:20:26Z","timestamp":1310149226000},"page":"416-436","source":"Crossref","is-referenced-by-count":12,"title":["Bin packing with \u201cLargest In Bottom\u201d constraint: tighter bounds and generalizations"],"prefix":"10.1007","volume":"26","author":[{"given":"Gyorgy","family":"Dosa","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,9]]},"reference":[{"issue":"1","key":"9408_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"KA Baker","year":"1971","unstructured":"Baker KA, Fishburn PC, Roberts FS (1971) Partial orders of dimension 2. Networks 2(1):11\u201328","journal-title":"Networks"},{"issue":"2","key":"9408_CR2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2307\/2272247","volume":"41","author":"DR Bean","year":"1976","unstructured":"Bean DR (1976) Effective coloration. J Symb Log 41(2):469\u2013480","journal-title":"J Symb Log"},{"key":"9408_CR3","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"9408_CR4","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E Coffman Jr","year":"1996","unstructured":"Coffman E Jr, Garey M, Johnson D (1996) Approximation algorithms for bin packing: a survey. In: Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, pp 46\u201393"},{"key":"9408_CR5","first-page":"1","volume-title":"Lecture Notes in Computer Sciences","author":"G Dosa","year":"2007","unstructured":"Dosa G (2007) The tight bound of bin packing algorithm FFD is FFD(I) < = 11\/9 OPT(I) + 6\/9. In: Lecture Notes in Computer Sciences, vol\u00a04614, ESCAPE 2007. Springer, Berlin, pp 1\u201311"},{"key":"9408_CR6","volume-title":"Proc Conf MATCOS-10","author":"G Dosa","year":"2010","unstructured":"Dosa G, Tuza Zs, Ye D (2010) Better bounds for the bin packing problem with LIB constraint. In: Proc Conf MATCOS-10. Press of University of Primorska"},{"issue":"3","key":"9408_CR7","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B Dushnik","year":"1941","unstructured":"Dushnik B, Miller EW (1941) Partially ordered sets. Am J Math 63(3):600\u2013610","journal-title":"Am J Math"},{"issue":"8","key":"9408_CR8","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1002\/nav.20383","volume":"56","author":"L Epstein","year":"2009","unstructured":"Epstein L (2009) On online bin packing with LIB constraints. Nav Res Logist 56(8):780\u2013786","journal-title":"Nav Res Logist"},{"key":"9408_CR9","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/11970125_13","volume-title":"Proceedings of workshop on approximation and online algorithms","author":"L Epstein","year":"2007","unstructured":"Epstein L, Levin A (2007) On bin packing with conflicts. In: Proceedings of workshop on approximation and online algorithms, pp\u00a0160\u2013173"},{"key":"9408_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-540-74240-1_25","volume-title":"Fundamentals of computation theory","author":"L Epstein","year":"2007","unstructured":"Epstein L, Levin A, van Stee R (2007) Multi-dimensional packing with conflicts. In: Fundamentals of computation theory. Lecture notes in computer science, vol 4639. Springer, Berlin, pp\u00a0288\u2013299"},{"key":"9408_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1051\/ro:2006001","volume":"39","author":"L Finlay","year":"2005","unstructured":"Finlay L, Manyem P (2005) Online LIB problems: heuristics for bin covering and lower bounds for Bin Packing. RAIRO Rech Op\u00e9r 39:163\u2013183","journal-title":"RAIRO Rech Op\u00e9r"},{"issue":"2","key":"9408_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1998","unstructured":"Gy\u00e1rf\u00e1s A, Lehel J (1998) On-line and first fit colorings of graphs. J Graph Theory 12(2):217\u2013227","journal-title":"J Graph Theory"},{"issue":"4","key":"9408_CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K Jansen","year":"1999","unstructured":"Jansen K (1999) An approximation scheme for bin packing with conflicts. J Comb Optim 3(4):363\u2013377","journal-title":"J Comb Optim"},{"key":"9408_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K Jansen","year":"1997","unstructured":"Jansen K, \u00d6hring S (1997) Approximation algorithms for time constrained scheduling. Inf Comput 132:85 C108","journal-title":"Inf Comput"},{"key":"9408_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0203025","volume":"3","author":"D Johnson","year":"1974","unstructured":"Johnson D, Demers A, Ullman J, Garey M, Graham R (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3:25\u2013278","journal-title":"SIAM J Comput"},{"key":"9408_CR16","first-page":"286","volume-title":"25th Symposium on the theory of computing","author":"C Lund","year":"1993","unstructured":"Lund C, Yannakakis M (1993) On the hardness of approximating minimization problem. In: 25th Symposium on the theory of computing, pp\u00a0286\u2013293"},{"key":"9408_CR17","first-page":"447","volume-title":"Topics in industrial mathematics","author":"P Manyem","year":"2003","unstructured":"Manyem P (2003) Uniform sized bin packing and covering: online version. In: Misra JC (ed) Topics in industrial mathematics. Narosa Publishing House, New Delhi, pp 447\u2013485"},{"issue":"4","key":"9408_CR18","first-page":"663","volume":"8","author":"P Manyem","year":"2003","unstructured":"Manyem P, Salt R, Visser M (2003) Approximation lower bounds in online LIB bin packing and covering. J Autom Lang Comb 8(4):663\u2013674","journal-title":"J Autom Lang Comb"},{"key":"9408_CR19","unstructured":"McCloskey B, Shankar A (2005) Approaches to bin packing with clique-graph conflicts. Technical Report UCB\/CSD-05-1378, EECS Department, University of California, Berkeley"},{"issue":"5","key":"9408_CR20","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S Seiden","year":"2002","unstructured":"Seiden S (2002) On the online bin packing problem. J ACM 49(5):640\u2013671","journal-title":"J ACM"},{"issue":"5","key":"9408_CR21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A Vliet van","year":"1992","unstructured":"van Vliet A (1992) An improved lower bound for on-line bin packing algorithms. Inf Process Lett 43(5):277\u2013284","journal-title":"Inf Process Lett"},{"issue":"15","key":"9408_CR22","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1016\/j.dam.2010.05.026","volume":"158","author":"BZ Xia","year":"2010","unstructured":"Xia BZ, Tan ZY (2010) Tighter bounds of the First Fit algorithm for the bin-packing problem. Discrete Appl Math 158(15):1668\u20131675","journal-title":"Discrete Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9408-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9408-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9408-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9408-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,9]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9408"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9408-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,9]]}}}