{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:19Z","timestamp":1759063519571},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1999,3]]},"abstract":"<jats:p> In broadcasting, or one-to-all communication, a message originally held in one node of the network must be transmitted to all the other nodes. A minimal broadcast network is a communication network that can transmit a message originated at any node to all other nodes of the network in minimum time. In this paper, we present a compound method to construct sparse, time-relaxed, minimal broadcast networks (t-mbn), in which broadcasting can be accomplished in slightly more than the minimum time. The proposed method generates a new network by connecting a subset of nodes from several copies of a t<jats:sub>1<\/jats:sub>-mbn using the structure of another t<jats:sub>2<\/jats:sub>-mbn. The objective is to construct a network as sparse as possible satisfying the desired broadcasting time constraint. Computational results illustrate the effectiveness of the proposed method. <\/jats:p>","DOI":"10.1142\/s0129626499000086","type":"journal-article","created":{"date-parts":[[2003,2,26]],"date-time":"2003-02-26T10:09:39Z","timestamp":1046254179000},"page":"53-68","source":"Crossref","is-referenced-by-count":3,"title":["CONSTRUCTION OF TIME-RELAXED MINIMAL BROADCAST NETWORKS"],"prefix":"10.1142","volume":"09","author":[{"given":"MICHAEL J.","family":"DINNEEN","sequence":"first","affiliation":[{"name":"Department of Computer Science, University  of Auckland, Private Bag 92019 Auckland, New Zealand"}]},{"given":"JOSE A.","family":"VENTURA","sequence":"additional","affiliation":[{"name":"Department of Industrial and Manufacturing  Engineering, The Pennsylvania State University, University Park, Pennsylvania  USA 16802, USA"}]},{"given":"MARK C.","family":"WILSON","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Auckland, Private Bag 92019 Auckland, New Zealand"}]},{"given":"GOLBON","family":"ZAKERI","sequence":"additional","affiliation":[{"name":"Department of Engineering Science,  University of Auckland, Private Bag 92019 Auckland, New Zealand"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260302"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90226-Z"},{"key":"p_3","first-page":"110","volume":"10","author":"Chau S.C.","year":"1985","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"p_4","first-page":"605","volume":"13","author":"Chen X.","year":"1990","journal-title":"Chinese J. Computers"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54522-0_104"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090404"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90022-0"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190606"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1137\/0404021"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230505"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02110308"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626499000086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:33:20Z","timestamp":1565184800000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626499000086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1999,3]]}},"alternative-id":["10.1142\/S0129626499000086"],"URL":"https:\/\/doi.org\/10.1142\/s0129626499000086","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}