{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T23:40:12Z","timestamp":1758843612146,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"16","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,1,27]],"date-time":"2000-01-27T00:00:00Z","timestamp":948931200000},"content-version":"vor","delay-in-days":483,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0140-3664(98)00170-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"1452-1461","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal grouping of components in a distributed system"],"prefix":"10.1016","volume":"21","author":[{"given":"Athina P.","family":"Markopoulou","sequence":"first","affiliation":[]},{"given":"Miltiades","family":"E. Anagnostou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(98)00170-4_BIB1","unstructured":"Towards the Personal Communication Environment: Green Paper on Mobile and Personal Communications, European Commission DGXIII, April 27, 1994."},{"key":"10.1016\/S0140-3664(98)00170-4_BIB2","unstructured":"L.J. Stockmeyer, The set basis problem is NP-complete, IBM Report RC-5431, May, 1975."},{"issue":"6","key":"10.1016\/S0140-3664(98)00170-4_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/355616.361019","article-title":"The minimization of spatially multiplexed character sets","volume":"17","author":"Gimbel","year":"1974","journal-title":"Commun. ACM"},{"key":"10.1016\/S0140-3664(98)00170-4_BIB4","doi-asserted-by":"crossref","unstructured":"L.T. Kou, C. K. Wong, A note on the set basis problem related to the compaction of character sets, IBM Report RC-5244, January, 1975.","DOI":"10.1145\/361219.361225"},{"key":"10.1016\/S0140-3664(98)00170-4_BIB5","first-page":"604","article-title":"An essay on prime implicants tables","volume":"9","author":"Pyne","year":"1961","journal-title":"J. SIAM"},{"issue":"4","key":"10.1016\/S0140-3664(98)00170-4_BIB6","first-page":"535","article-title":"A reduction technique for prime implicant tables","volume":"14","author":"Gimbel","year":"1965","journal-title":"IEEE Trans."},{"issue":"2","key":"10.1016\/S0140-3664(98)00170-4_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TEC.1961.5219148","article-title":"Computer design of multiple-output logical networks","volume":"10","author":"Bartee","year":"1961","journal-title":"IRE Trans."},{"key":"10.1016\/S0140-3664(98)00170-4_BIB8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TIT.1957.1057403","article-title":"Determination of redundancies in a set of patterns","volume":"3","author":"McCluskey","year":"1957","journal-title":"IRE Trans. Inf. Theory"},{"key":"10.1016\/S0140-3664(98)00170-4_BIB9","unstructured":"H.D. Block, N.J. Nilsson, R.O. Duda, Determination and detection of features in patterns, in: J.T. Tou, R.H. Wilcox (Eds.), Computer and Information Sciences, Spartan Books, Washington, DC, 1964, pp. 75-110."},{"key":"10.1016\/S0140-3664(98)00170-4_BIB10","unstructured":"P. Barth, A Davis-Putnam Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization, Max-Planck-Instut fuer Informatik, January, 1995 (+OPBDP package: ftp.mpi-sb.mpg.de:pub\/guide\/staff\/barth\/opbdp\/)."},{"key":"10.1016\/S0140-3664(98)00170-4_BIB11","unstructured":"CEC deliverable R2066\/BT\/PM2\/DS\/P\/070\/b2, UMTS System Structure Document."},{"key":"10.1016\/S0140-3664(98)00170-4_BIB12","unstructured":"R.S. Garfinkel, G.L. Nemhauser, Integer Programming, Wiley-Interscience, New York, 1972."},{"key":"10.1016\/S0140-3664(98)00170-4_BIB13","unstructured":"F. Afrati, G. Papageorgiou, Algorithms: Design Methods and Complexity Analysis, National Tech. Univ. Athens Press, Athens 1993 (in Greek)."},{"key":"10.1016\/S0140-3664(98)00170-4_BIB14","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498001704?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498001704?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T23:04:47Z","timestamp":1758841487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366498001704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":14,"journal-issue":{"issue":"16","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0140366498001704"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(98)00170-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"type":"print","value":"0140-3664"}],"subject":[],"published":{"date-parts":[[1998,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal grouping of components in a distributed system","name":"articletitle","label":"Article Title"},{"value":"Computer Communications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0140-3664(98)00170-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}