{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:33Z","timestamp":1725484653108},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45995-2_49","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"569-583","source":"Crossref","is-referenced-by-count":0,"title":["Tight Bounds for Online Class-Constrained Packing"],"prefix":"10.1007","author":[{"given":"Hadas","family":"Shachnai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-45678-3_59","volume-title":"Algorithms and Computation","author":"Luitpold Babel","year":"2001","unstructured":"L. Babel, B. Chen, H. Kellerer, and V. Kotov. On-line algorithms for cardinality constraint bin packing problems. Technical report, Institut fuer Statistik und Operations Research, Universitaet Graz, 2001."},{"key":"49_CR2","unstructured":"A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998."},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A. Caprara","year":"2000","unstructured":"A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operations Research, 123:333\u2013345, 2000.","journal-title":"European Journal of Operations Research"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"W. J. Davis, D. L. Setterdahl, J. G. Macro, V. Izokaitis, and B. Bauman. Recent advances in the modeling, scheduling and control of fiexible automation. In Proc. of the Winter Simulation Conference, 143\u2013155, 1993.","DOI":"10.1145\/256563.256610"},{"key":"49_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","volume-title":"Online Algorithms: The State of the Art","author":"A. Fiat","year":"1998","unstructured":"A. Fiat and G.J. Woeginger. Online Algorithms: The State of the Art. LNCS. 1442, Springer-Verlag, 1998."},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"M.R. Garey, R.L. Graham, and J.D. Ullman. Worst-case analysis of memory allocation algorithms. In Proc. of STOC, 143\u2013150, 1972.","DOI":"10.1145\/800152.804907"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-8191(97)00118-X","volume":"24","author":"S. Ghandeharizadeh","year":"1998","unstructured":"S. Ghandeharizadeh and R.R. Muntz. Design and implementation of scalable continuous media servers. Parallel Computing Journal, 24(1):91\u2013122, 1998.","journal-title":"Parallel Computing Journal"},{"key":"49_CR8","unstructured":"L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu. Approximation algorithms for data placement on parallel disks. In Proc. of SODA, 223\u2013232, 2000."},{"key":"49_CR9","unstructured":"D.S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PUS Publishing Company, 1995."},{"key":"49_CR10","unstructured":"D.S. Johnson. Near-optimal bin packing algorithms. PhD thesis, MIT, 1973."},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson. Fast algorithms for bin packing. J. Comput. Sys. Sci., 8:272\u2013314, 1974.","journal-title":"J. Comput. Sys. Sci."},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithm. SIAM Journal of Computing, 3:256\u2013278, 1974.","journal-title":"SIAM Journal of Computing"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1018947117526","volume":"92","author":"H. Kellerer","year":"1999","unstructured":"H. Kellerer and U. Pferschy. Cardinality constrained bin-packing problems. Annals of Operations Research, 92:335\u2013349, 1999.","journal-title":"Annals of Operations Research"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"S.O. Krumke, W. de Paepe, J. Rambau and L. Stougie. Online bin-coloring. In Proc. of ESA, 74\u201385, 2001.","DOI":"10.1007\/3-540-44676-1_6"},{"key":"49_CR15","first-page":"213","volume":"31","author":"S. Martello","year":"1987","unstructured":"S. Martello and P. Toth. Algorithms for knapsack problems. Annals of Discrete Math., 31:213\u2013258, 1987.","journal-title":"Annals of Discrete Math."},{"key":"49_CR16","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jos.86","volume":"4","author":"H. Shachnai","year":"2001","unstructured":"H. Shachnai and T. Tamir. Polynomial time approximation schemes for classconstrained packing problems. Journal of Scheduling, 4:313\u2013338, 2001.","journal-title":"Journal of Scheduling"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"H. Shachnai and T. Tamir. Multiprocessor scheduling with machine allotment and parallelism constraints. 2001. Algorithmica, to appear.","DOI":"10.1007\/s00453-001-0098-3"},{"key":"49_CR18","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s004530010057","volume":"29","author":"H. Shachnai","year":"2001","unstructured":"H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem. Algorithmica, 29:442\u2013467, 2001.","journal-title":"Algorithmica"},{"key":"49_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1006\/jagm.1996.0005","volume":"20","author":"A. Vliet van","year":"1996","unstructured":"A. van Vliet. On the asymptotic worst case behavior of harmonic fit. J. of Algorithms, 20:113\u2013136, 1996.","journal-title":"J. of Algorithms"},{"key":"49_CR20","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s005300050067","volume":"5","author":"J.L. Wolf","year":"1997","unstructured":"J.L. Wolf, P.S. Yu, and H. Shachnai. Disk load balancing for video-on-demand systems. ACM Multimedia Systems Journal, 5:358\u2013370, 1997.","journal-title":"ACM Multimedia Systems Journal"},{"key":"49_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A. Yao","year":"1980","unstructured":"A. Yao. New algorithms for bin packing. Journal of the ACM, 27:207\u2013227, 1980.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:30:24Z","timestamp":1556454624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}