{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T15:14:34Z","timestamp":1712762074525},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T00:00:00Z","timestamp":1527033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10878-018-0310-x","type":"journal-article","created":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T11:13:40Z","timestamp":1527074020000},"page":"508-531","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Min-Sum Bin Packing"],"prefix":"10.1007","volume":"36","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"David S.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,23]]},"reference":[{"key":"310_CR1","volume-title":"Approximation algorithms for bin packing: a survey","author":"E\u00a0G Coffman","year":"1997","unstructured":"Coffman E\u00a0G, Garey M\u00a0R, Johnson D\u00a0S (1997) Approximation algorithms. In: Hochbaum D (ed) Approximation algorithms for bin packing: a survey. PWS Publishing Company, Boston"},{"key":"310_CR2","doi-asserted-by":"crossref","unstructured":"Csirik J, Woeginger GJ (1998) On-line packing and covering problems. In: Fiat A, Woeginger GJ (eds) Online algorithms: the state of the art, pp 147\u2013177","DOI":"10.1007\/BFb0029568"},{"issue":"4","key":"310_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00453-007-9161-z","volume":"55","author":"L Epstein","year":"2009","unstructured":"Epstein L, Halld\u00f3rsson MM, Levin A, Shachnai H (2009) Weighted sum coloring in batch scheduling of conflicting jobs. Algorithmica 55(4):643\u2013665","journal-title":"Algorithmica"},{"key":"310_CR4","unstructured":"Epstein L, Levin A (2007) Minimum weighted sum bin packing. In: Proceedings of the 5th international workshop on approximation and online algorithms (WAOA\u20192007), pp. 218\u2013231"},{"key":"310_CR5","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 GS (1981) Bin packing can be solved within +\\varepsilon $ in linear time. Combinatorica 1:349\u2013355","journal-title":"Combinatorica"},{"issue":"4","key":"310_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U Feige","year":"2004","unstructured":"Feige U, Lov\u00e1sz L, Tetali P (2004) Approximating min sum set cover. Algorithmica 40(4):219\u2013234","journal-title":"Algorithmica"},{"key":"310_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256\u2013278","journal-title":"J Comput Syst Sci"},{"key":"310_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e0sz","year":"1975","unstructured":"Lov\u00e0sz L (1975) On the ratio of optimal integral and fractional covers. Discrete Math 13:383\u2013390","journal-title":"Discrete Math"},{"key":"310_CR9","unstructured":"Munagala K, Babu S, Motwani R, Widom J (2005) The pipelined set cover problem. In: Proceedings of the 10th international conference on database theory (ICDT\u20192005), pp 83\u201398"},{"issue":"1\u20132","key":"310_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3(1\u20132):59\u201366","journal-title":"Naval Res Logist Q"},{"key":"310_CR11","unstructured":"Ullman JD (1971) The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0310-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0310-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0310-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:36:57Z","timestamp":1558589817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0310-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,23]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["310"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0310-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,23]]},"assertion":[{"value":"23 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}