{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:24:04Z","timestamp":1648992244716},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0012-365x(93)90358-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"87-103","source":"Crossref","is-referenced-by-count":1,"title":["Fast exact and approximate algorithms for k-partition and scheduling independent tasks"],"prefix":"10.1016","volume":"114","author":[{"given":"Mark","family":"Chaimovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90358-Z_BIB1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02189086","article-title":"On sums of subsets of a set of integers","volume":"8","author":"Alon","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(93)90358-Z_BIB2","author":"Chaimovich","year":"1988","journal-title":"An efficient algorithm for subset-sum problem"},{"key":"10.1016\/0012-365X(93)90358-Z_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0166-218X(90)90071-J","article-title":"Subset sum problem with different summands: computation","volume":"27","author":"Chaimovich","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)90358-Z_BIB4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0885-064X(89)90025-3","article-title":"Solving dense subset-sum problems by using analytic number theory","volume":"5","author":"Chaimovich","year":"1989","journal-title":"J. Complexity"},{"key":"10.1016\/0012-365X(93)90358-Z_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-314X(90)90047-U","article-title":"On two additive problems","volume":"34","author":"Erd\u0151s","year":"1990","journal-title":"J. Number Theory"},{"key":"10.1016\/0012-365X(93)90358-Z_BIB6","first-page":"93","article-title":"On extremal additive problems of Paul Erd\u0151s","volume":"26B","author":"Freiman","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)90358-Z_BIB7","first-page":"207","article-title":"Subset sum problem with different summands","volume":"70","author":"Freiman","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(93)90358-Z_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(93)90367-3","article-title":"New analytical results in subset-sum problem","volume":"114","author":"Freiman","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90358-Z_BIB9","author":"Garey","year":"1979","journal-title":"Computers and Intractability: A Guide to the Theory of NP-completeness"},{"key":"10.1016\/0012-365X(93)90358-Z_BIB10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.4064\/aa-52-4-353-365","article-title":"On representation of r-powers by subset sums","volume":"LII","author":"Lipkin","year":"1989","journal-title":"Acta Arithmetica"},{"key":"10.1016\/0012-365X(93)90358-Z_BIB11","unstructured":"O. Margalit, Efficient elementary methods for the dense subset sum problem, M.Sc Thesis. Tel-Aviv University Ramat-Aviv."},{"key":"10.1016\/0012-365X(93)90358-Z_BIB12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0166-218X(86)90059-4","article-title":"An introduction to the analysis of approximation algorithms","volume":"14","author":"Rihnoou Kan","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)90358-Z_BIB13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390358Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390358Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:53:08Z","timestamp":1555134788000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390358Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0012365X9390358Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90358-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}