{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T05:45:18Z","timestamp":1777527918659,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1025838126048","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T15:29:37Z","timestamp":1067009377000},"page":"47-59","source":"Crossref","is-referenced-by-count":5,"title":["Construction of Time-Relaxed c-Broadcast Networks"],"prefix":"10.1007","volume":"24","author":[{"given":"Shiwoo","family":"Lee","sequence":"first","affiliation":[]},{"given":"Jose A.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5142174_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0166-218X(99)00043-8","volume":"93","author":"M.J. Dinneen","year":"1999","unstructured":"M.J. Dinneen, J.A. Ventura, M.C. Wilson and G. Zakeri, Compound constructions of minimal broadcast networks, Discrete Applied Mathematics 93 (1999) 205-232.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"5142174_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1142\/S0129626499000086","volume":"9","author":"M.J. Dinneen","year":"1999","unstructured":"M.J. Dinneen, J.A. Ventura, M.C.Wilson and G. Zakeri, Construction of time-relaxed minimal broadcast networks, Parallel Processing Letters 9(1) (1999) 53-68.","journal-title":"Parallel Processing Letters"},{"issue":"2","key":"5142174_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","volume":"4","author":"M. Grigni","year":"1991","unstructured":"M. Grigni and D. Peleg, Tight bounds on minimum broadcast networks, SIAM Journal on Discrete Mathematics 4(2) (1991) 207-222.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"5142174_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1002\/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6","volume":"37","author":"Harutyunyan","year":"2001","unstructured":"Harutyunyan and A. Liestman, Improved upper and lower bounds for k-broadcasting, Networks 37(2) (2001) 94-101.","journal-title":"Networks"},{"issue":"3","key":"5142174_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/net.1034","volume":"38","author":"Harutyunyan","year":"2001","unstructured":"Harutyunyan and A. Liestman, k-Broadcasting in trees, Networks 38(3) (2001) 163-168.","journal-title":"Networks"},{"key":"5142174_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(94)90185-6","volume":"53","author":"J.C. Konig","year":"1994","unstructured":"J.C. Konig and E. Lazard, Minimum k-broadcat graphs, Discrete Applied Mathematics 53 (1994) 199-209.","journal-title":"Discrete Applied Mathematics"},{"key":"5142174_CR7","first-page":"387","volume":"37\/38","author":"E. Lazard","year":"1992","unstructured":"E. Lazard, Broadcasting in DMA-bound bounded degree graphs, Discrete AppliedMathematics 37\/38 (1992) 387-400.","journal-title":"Discrete AppliedMathematics"},{"key":"5142174_CR8","volume-title":"Information dissemination theory in communication network: design of c-broadcast networks","author":"S. Lee","year":"1998","unstructured":"S. Lee, Information dissemination theory in communication network: design of c-broadcast networks, Ph.D. thesis, Department of of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, PA (1998)."},{"key":"5142174_CR9","series-title":"Working paper","volume-title":"Lower bounds for the size in two infinite families of optimal c-broadcast networks","author":"S. Lee","year":"1998","unstructured":"S. Lee and J.A. Ventura, Lower bounds for the size in two infinite families of optimal c-broadcast networks, Working paper 98-104, Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, PA (1998)."},{"key":"5142174_CR10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1002\/net.1019","volume":"38","author":"S. Lee","year":"2001","unstructured":"S. Lee and J.A. Ventura, An algorithm for constructing minimal c-broadcast networks, Networks 38 (2001) 6-21.","journal-title":"Networks"},{"key":"5142174_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(97)00114-5","volume":"83","author":"A. Shastri","year":"1998","unstructured":"A. Shastri, Time-relaxed broadcasting in communication networks, Discrete Applied Mathematics 83 (1998) 263-278.","journal-title":"Discrete Applied Mathematics"},{"key":"5142174_CR12","unstructured":"A. Shastri and S. Gaur, Multi-broadcasting in communication networks, Unpublished manuscript (1998)."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025838126048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025838126048\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025838126048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:40:32Z","timestamp":1754635232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025838126048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5142174"],"URL":"https:\/\/doi.org\/10.1023\/a:1025838126048","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}