{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:50:21Z","timestamp":1648867821755},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"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":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00121-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:55:55Z","timestamp":1027594555000},"page":"93-117","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing broadcast costs under edge reductions in tree networks"],"prefix":"10.1016","volume":"91","author":[{"given":"Susanne E.","family":"Hambrusch","sequence":"first","affiliation":[]},{"given":"Hyeong-Seok","family":"Lim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00121-8_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF01184933","article-title":"Designing broadcasting algorithms in the postal model for message-passing systems","volume":"27","author":"Bar-Noy","year":"1994","journal-title":"Math. System Theory"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB2","series-title":"Proc. 6th IEEE Symp. on Parallel and Distributed Processing","first-page":"216","article-title":"Optimal broadcasting in telephone communication networks","author":"Bar-Noy","year":"1994"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/43.205000","article-title":"Critical path selection for performance optimization. IEEE Trans on Comput.-Aidcd Des","volume":"12","author":"Chen","year":"1993","journal-title":"Integrated Circuits Systems"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB4","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB5","series-title":"Introductory Management Science","author":"Eppen","year":"1992"},{"issue":"2","key":"10.1016\/S0166-218X(98)00121-8_BIB6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0139032","article-title":"Broadcast time in communication networks","volume":"39","author":"Farley","year":"1980","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00121-8_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00121-8_BIB8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jagm.1997.0856","article-title":"Edge weight reduction problems in directed, acyclic graphs","volume":"24","author":"Hambrusch","year":"1997","journal-title":"J. Algorithms."},{"issue":"4","key":"10.1016\/S0166-218X(98)00121-8_BIB9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"Survey of gossiping and communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0743-7315(91)90094-P","article-title":"Optimal broadcasting on SIMD hypercubes without indirect addressing capability","volume":"13","author":"Ho","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(98)00121-8_BIB11","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(98)00121-8_BIB12","series-title":"Proc. 5th ACM Symp. on Parallel Algorithms and Architectures","first-page":"142","article-title":"Optimal broadcast and summation in the logP model","author":"Karp","year":"1993"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB13","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1109\/12.93751","article-title":"Information dissemination in trees with nonuniform edge transmission times","volume":"40","author":"Koh","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(98)00121-8_BIB14","first-page":"281","article-title":"Improving spanning trees by upgrading nodes","volume":"vol. 1256","author":"Krumkc","year":"1997"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.3230260105","article-title":"Network upgrading problems","volume":"26","author":"Paik","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00121-8_BIB16","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","article-title":"Information dissemination in trees","volume":"10","author":"Slater","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001218?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:30:17Z","timestamp":1556382617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98001218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98001218"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00121-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}