{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:57:52Z","timestamp":1742399872443,"version":"3.30.2"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00423-7","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T01:10:51Z","timestamp":1045012251000},"page":"169-177","source":"Crossref","is-referenced-by-count":6,"title":["The task allocation problem with constant communication"],"prefix":"10.1016","volume":"131","author":[{"given":"W.","family":"Fernandez de la Vega","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Lamari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-218X(02)00423-7_BIB1","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1145\/146637.146646","article-title":"An efficient algorithm for the task allocation problem","volume":"39","author":"Billionnet","year":"1992","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/S0166-218X(02)00423-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1981.226469","article-title":"A shortest tree algorithm for optimal assignments across space and time in a distributed processor system","volume":"SE-7","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0166-218X(02)00423-7_BIB3","doi-asserted-by":"crossref","unstructured":"E. Dalhaus, D.S. Johnson, C.H. Papadimitriou, P. Seymour, M. Yannakakis, The complexity of multiway cut, in: Proceedings of the 24th ACM STOC, 1992, pp. 241\u2013251.","DOI":"10.1145\/129712.129736"},{"year":"1988","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","key":"10.1016\/S0166-218X(02)00423-7_BIB4"},{"key":"10.1016\/S0166-218X(02)00423-7_BIB5","unstructured":"M. Lamari, W. Fernandez de la Vega, The module allocation problem; an average case analysis, irregular 96, Santa Barbara, CA, Lecture Notes in Computer Science, Vol. 1117, Springer, Berlin, 1996, pp. 307\u2013312."},{"key":"10.1016\/S0166-218X(02)00423-7_BIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0167-6377(92)90015-U","article-title":"An improved partial solution to the task assignment and multi-way cut problems","volume":"12","author":"Magirou","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(02)00423-7_BIB7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0167-6377(89)90022-9","article-title":"An algorithm for the multiprocessor assignment problem","volume":"8","author":"Magirou","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(02)00423-7_BIB8","first-page":"1384","article-title":"Heuristic algorithms for task assignment in distributed systems","volume":"TSC-37","author":"Mary Lo","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00423-7_BIB9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0166-218X(02)00423-7_BIB10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"SE-3","author":"Stone","year":"1977","journal-title":"IEEE Trans. Software Engrg."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T20:11:52Z","timestamp":1733947912000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004237"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00423-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}