{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:24Z","timestamp":1725664704430},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616801"},{"type":"electronic","value":"9783540706670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61680-2_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:11:27Z","timestamp":1330276287000},"page":"406-418","source":"Crossref","is-referenced-by-count":3,"title":["On-line and off-line approximation algorithms for vector covering problems"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Csirik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey V.","family":"Sevastianov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjen P. A.","family":"Vestjens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01787474","volume":"6","author":"N. Alon","year":"1990","unstructured":"N. Alon, Transversal numbers of uniform hypergraphs, Graphs and Combinatorics\n6, 1990, 1\u20134.","journal-title":"Graphs and Combinatorics"},{"key":"30_CR2","volume-title":"Doctoral Dissertation","author":"S.F. Assmann","year":"1983","unstructured":"S.F. Assmann, \u201cProblems in Discrete Applied Mathematics\u201d, Doctoral Dissertation, Mathematics Department, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1983."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S.F. Assmann","year":"1984","unstructured":"S.F. Assmann, D.S. Johnson, D. J. Kleitman, and J.Y.-T. Leung, On a dual version of the one-dimensional bin packing problem, J. Algorithms\n5, 1984, 502\u2013525.","journal-title":"J. Algorithms"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(81)90022-6","volume":"3","author":"J. Beck","year":"1981","unstructured":"J. Beck and T. Fiala, Integer-making Theorems, Disc. Appl. Math.\n3, 1981, 1\u20138.","journal-title":"Disc. Appl. Math."},{"key":"30_CR5","first-page":"87","volume":"1","author":"J. Csirik","year":"1990","unstructured":"J. Csirik and J.B.G. Frenk, A dual version of bin packing, Algorithms Review\n1, 1990, 87\u201395.","journal-title":"Algorithms Review"},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0196-6774(91)90001-F","volume":"12","author":"J. Csirik","year":"1991","unstructured":"J. Csirik, J.B.G. Frenk, G. Galambos, and A.H.G. Rinnooy Kan, Probabilistic analysis of algorithms for dual bin packing problems, J. Algorithms\n12, 1991, 189\u2013203.","journal-title":"J. Algorithms"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(88)90052-2","volume":"21","author":"J. Csirik","year":"1988","unstructured":"J. Csirik and V. Totik, On-line algorithms for a dual version of bin packing, Discr. Appl. Math.\n21, 1988, 163\u2013167.","journal-title":"Discr. Appl. Math."},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. F. Vega de la","year":"1981","unstructured":"W. Fernandez de la Vega and G.S. Lueker, Bin packing can be solved within 1 + \u03b5 in linear time, Combinatorica\n1, 1981, 349\u2013355.","journal-title":"Combinatorica"},{"key":"30_CR9","volume-title":"An algorithm for the 2D dual bin packing problem","author":"T. Gaizer","year":"1989","unstructured":"T. Gaizer, An algorithm for the 2D dual bin packing problem, unpublished manuscript, University of Szeged, Hungary, 1989."},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, R.L. Graham, D.S. Johnson, and A.C. Yao, Resource constrained scheduling as generalized bin packing, J. Combinatorial Theory Sci. A\n21, 1976, 257\u2013298.","journal-title":"J. Combinatorial Theory Sci. A"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs, Journal of Computer and System Sciences\n37, 1988, 130\u2013143.","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(91)90087-D","volume":"34","author":"M.B. Richey","year":"1991","unstructured":"M.B. Richey, Improved bounds for harmonic-based bin packing algorithms, Discrete Applied Mathematics\n34, 1991, 203\u2013227.","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR13","first-page":"226","volume":"10","author":"S.V. Sevastianov","year":"1988","unstructured":"S.V. Sevastianov, Geometry in the theory of scheduling, Trudy Instituta Matematiki Sibirskogo Otdelenia Akademii Nauk SSSR\n10, 1988, 226\u2013261. (in Russian).","journal-title":"Trudy Instituta Matematiki Sibirskogo Otdelenia Akademii Nauk SSSR"},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(94)90036-1","volume":"55","author":"S.V. Sevastianov","year":"1994","unstructured":"S.V. Sevastianov, On some geometric methods in scheduling theory: a survey, Discrete Applied Mathematics\n55, 1994, 59\u201382.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61680-2_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:35:26Z","timestamp":1619559326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61680-2_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616801","9783540706670"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61680-2_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}