{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:16:40Z","timestamp":1773656200591,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0020-0190(97)00008-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"205-208","source":"Crossref","is-referenced-by-count":6,"title":["On approximating the memory-Constrained Module Allocation Problem"],"prefix":"10.1016","volume":"61","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(97)00008-2_BIB1","first-page":"83","article-title":"Placement de t\u00e2ches dans un syst\u00e8me distribu\u00e9 et dualit\u00e9 Lagrangienne","volume":"26","author":"Billionnet","year":"1992","journal-title":"Rech. Op\u00e9rationnelle"},{"issue":"1","key":"10.1016\/S0020-0190(97)00008-2_BIB2","first-page":"117","article-title":"Placement de t\u00e2ches \u00e0 structure arborescente avec contraintes de charge","volume":"11","author":"Billionnet","year":"1992","journal-title":"Tech. Sci. Informatique"},{"key":"10.1016\/S0020-0190(97)00008-2_BIB3","article-title":"Optimal assignments in dual-processor distributed systems under varying load conditions","author":"Bokhari","year":"1979","journal-title":"ICASE Rept. 79-14"},{"key":"10.1016\/S0020-0190(97)00008-2_BIB4","series-title":"Assignments Problems in Parallel and Distributed Computing","author":"Bokhari","year":"1987"},{"issue":"4","key":"10.1016\/S0020-0190(97)00008-2_BIB5","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","article-title":"The complexity of multiterminal cuts","volume":"23","author":"Dahlaus","year":"1994","journal-title":"SIAM J. Comput."},{"issue":"11","key":"10.1016\/S0020-0190(97)00008-2_BIB6","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1109\/32.41334","article-title":"Allocating modules to processors in a distributed system","volume":"15","author":"Fernandez-Bacca","year":"1989","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/S0020-0190(97)00008-2_BIB7","first-page":"170","article-title":"One-half approximation algorithms for the k-partition problem","volume":"40","author":"Feo","year":"1992","journal-title":"Oper. Res. Soc. America"},{"key":"10.1016\/S0020-0190(97)00008-2_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)00008-2_BIB9","article-title":"Task assignment in distributed systems","author":"Lo","year":"1983"},{"issue":"4","key":"10.1016\/S0020-0190(97)00008-2_BIB10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1979.1675348","article-title":"Assignment of tasks in a distributed processor system with limited memory","volume":"28","author":"Rao","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0020-0190(97)00008-2_BIB11","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TSE.1978.231502","article-title":"Critical load factors in two-processor distributed systems","volume":"4","author":"Stone","year":"1978","journal-title":"IEEE Trans. Software Engineering"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000082?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000082?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:53:06Z","timestamp":1555944786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0020019097000082"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00008-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}