{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T04:24:06Z","timestamp":1662179046925},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1007\/bf00292111","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T16:13:40Z","timestamp":1096992820000},"page":"417-432","source":"Crossref","is-referenced-by-count":9,"title":["Parallel approximation schemes for Subset Sum and Knapsack problems"],"prefix":"10.1007","volume":"24","author":[{"given":"Joseph G.","family":"Peters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Rudolph","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Fortune, S., Wyllie, J.: Parallelism in random access machines. Proc. 10th ACM Symposium on Theory of Computing, May 1978, pp. 114?118","DOI":"10.1145\/800133.804339"},{"key":"CR2","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W.H. Freeman 1979"},{"key":"CR3","first-page":"38","volume":"16","author":"G.V. Gens","year":"1978","unstructured":"Gens, G.V., Levner, E.V.: Approximate algorithms for certain universal problems in scheduling theory. Izv. Akad. Nauk SSSR, Tech. Kibernet. 16:38?43 (1978)","journal-title":"Izv. Akad. Nauk SSSR, Tech. Kibernet"},{"key":"CR4","first-page":"1","volume":"17","author":"G.V. Gens","year":"1979","unstructured":"Gens, G.V., Levner, Ye.V.: Discrete optimization problems and efficient approximate algorithms (A survey). Eng. Cybernetics 17:1?11 (1979)","journal-title":"Eng. Cybernetics"},{"key":"CR5","series-title":"Lecture Notes in Control and Information Sciences, Vol. 23","first-page":"185","volume-title":"Proc. 9th IFIP Conference on Optimization Techniques","author":"G.V. Gens","year":"1979","unstructured":"Gens, G.V., Levner, E.V.: Fast approximation algorithms for knapsack type problems. In: Proc. 9th IFIP Conference on Optimization Techniques, Lecture Notes in Control and Information Sciences, Vol. 23, pp. 185?194. Berlin, Heidelberg, New York: Springer 1979"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/1008861.1008867","volume":"12","author":"G. Gens","year":"1980","unstructured":"Gens, G., Levner, E.: Complexity of approximation algorithms for combinatorial problems: a survey. SIGACT News 12:52?65 (1980)","journal-title":"SIGACT News"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.K.: Exact and approximate algorithms for scheduling nonidentical processors. Journal ACM 23:317?327 (1976)","journal-title":"Journal ACM"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subsets problems. J. ACM 22:463?468 (1975)","journal-title":"J. ACM"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. Proc. 18th IEEE Symp. Found. Comput. Sci., pp. 206?213. Providence, Rhode Island, Oct 31?Nov 2, 1977","DOI":"10.1109\/SFCS.1977.11"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Leighton, T.: Tight bounds on the complexity of parallel sorting. Proc. 16th ACM Symp. Theory Comput., pp. 71?80. Washington, D.C. 1984","DOI":"10.1145\/800057.808667"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(81)90047-5","volume":"14","author":"S. Moran","year":"1981","unstructured":"Moran, S.: General approximation algorithms for some arithmetical combinatorial problems. Theor. Comput. Sci. 14:289?303 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"CR12","unstructured":"Peters, J., Rudolph, L.: Parallel approximation schemes for subset sum and knapsack problems. Dept. of Computer Science, Carnegie-Mellon University, Technical Report CMU-CS-84-155, August 1984"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S.K. Sahni","year":"1976","unstructured":"Sahni, S.K.: Algorithms for scheduling independent tasks. Journal ACM 23:116?127 (1976)","journal-title":"Journal ACM"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1287\/opre.25.6.920","volume":"25","author":"S. Sahni","year":"1977","unstructured":"Sahni, S.: General techniques for combinatorial approximation. Oper. Res. 25:920?936 (1977)","journal-title":"Oper. Res."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292111.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00292111\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:16:24Z","timestamp":1554758184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00292111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["BF00292111"],"URL":"https:\/\/doi.org\/10.1007\/bf00292111","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}