{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:46:04Z","timestamp":1649173564485},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2007,10]]},"abstract":"<jats:p> This theoretical paper presents a new construction algorithm for sparse 1-fault tolerant minimal broadcast networks (1-FTMBNs). To construct a large 1-FTMBN with the algorithm, identical nodes in copies of a broadcast network that is not fault tolerant are connected according to the edge structures of two known 1-FTMBNs with a special property. In most cases, computational results with this algorithm produce the best-known bounds on the cardinalities of the edge sets of the sparsest 1-FTMBNs with an odd number of nodes. <\/jats:p>","DOI":"10.1142\/s0217595907001450","type":"journal-article","created":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T08:55:19Z","timestamp":1196240119000},"page":"687-713","source":"Crossref","is-referenced-by-count":1,"title":["A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS"],"prefix":"10.1142","volume":"24","author":[{"given":"BRIAN Q.","family":"RIEKSTS","sequence":"first","affiliation":[{"name":"Harold and Inge Marcus Department of Industrial &amp; Manufacturing Engineering, The Pennsylvania State University, University Park, PA 16802, USA"}]},{"given":"JOS\u00c9 A.","family":"VENTURA","sequence":"additional","affiliation":[{"name":"Harold and Inge Marcus Department of Industrial &amp; Manufacturing Engineering, The Pennsylvania State University, University Park, PA 16802, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<293::AID-NET4>3.0.CO;2-B"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90226-Z"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260302"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00043-8"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090404"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90022-0"},{"key":"rf7","first-page":"469","author":"Gargano L.","journal-title":"Networks"},{"key":"rf8","first-page":"637","volume":"19","author":"Gargano L.","journal-title":"Networks"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00108-0"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150203"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N"},{"key":"rf13","volume-title":"User's Manual for LINGO","author":"Schrage L.","year":"1991"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02110308"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595907001450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:57:01Z","timestamp":1565186221000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595907001450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":13,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,10]]}},"alternative-id":["10.1142\/S0217595907001450"],"URL":"https:\/\/doi.org\/10.1142\/s0217595907001450","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}