{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:54:58Z","timestamp":1774626898209,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319149738","type":"print"},{"value":"9783319149745","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_3","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"21-32","source":"Crossref","is-referenced-by-count":5,"title":["Constant Approximation for Broadcasting in k-cycle Graph"],"prefix":"10.1007","author":[{"given":"Puspal","family":"Bhabak","sequence":"first","affiliation":[]},{"given":"Hovhannes A.","family":"Harutyunyan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Multicasting in heterogeneous networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC 1998), pp. 448\u2013453 (1998)","DOI":"10.1145\/276698.276857"},{"key":"3_CR2","unstructured":"Beier, R., Sibeyn, J.F.: A powerful heuristic for telephone gossiping. In: Proceedings of the 7th International Colloquium on Structural Information Communication Complexity (SIROCCO 2000), pp. 17\u201336 (2000)"},{"key":"3_CR3","unstructured":"Bhabak, P., Harutyunyan, H.A.: Approximation algorithm for the broadcast time in k-path graph (abstract only). In: 3rd International Symposium on Combinatorial Optimization (ISCO 2014), p. 83 (2014)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Elkin, M., Kortsarz, G.: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. In: Proceedings of the thirty-fourth Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 438\u2013447 (2002)","DOI":"10.1145\/509967.509972"},{"key":"3_CR5","unstructured":"Elkin, M., Kortsarz, G.: Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract). In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 76\u201385 (2003)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jpdc.1997.1318","volume":"43","author":"P. Fraigniaud","year":"1997","unstructured":"Fraigniaud, P., Vial, S.: Approximation algorithms for broadcasting and gossiping. J. Parallel and Distrib. Comput.\u00a043(1), 47\u201355 (1997)","journal-title":"J. Parallel and Distrib. Comput."},{"key":"3_CR7","unstructured":"Fraigniaud, P., Vial, S.: Heuristic algorithms for personalized communication problems in point-to-point networks. In: Proceedings of the 4th Colloquium on Structural Information Communication Complexity (SIROCCO 1997), pp. 240\u2013252 (1997)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1142\/S0129626499000049","volume":"9","author":"P. Fraigniaud","year":"1999","unstructured":"Fraigniaud, P., Vial, S.: Comparison of heuristics for one-to-all and all-to-all communication in partial meshes. Parallel Processing Letters\u00a09, 9\u201320 (1999)","journal-title":"Parallel Processing Letters"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10878-008-9160-2","volume":"16","author":"H.A. Harutyunyan","year":"2008","unstructured":"Harutyunyan, H.A., Maraachlian, E.: On broadcasting in unicyclic graphs. J. Comb. Optim.\u00a016(3), 307\u2013322 (2008)","journal-title":"J. Comb. Optim."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Harutyunyan, H.A., Maraachlian, E.: Broadcasting in fully connected trees. In: Proceedings of the 2009 15th International Conference on Parallel and Distributed Systems (ICPADS 2009), pp. 740\u2013745 (2009)","DOI":"10.1109\/ICPADS.2009.48"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jpdc.2005.06.010","volume":"66","author":"H.A. Harutyunyan","year":"2006","unstructured":"Harutyunyan, H.A., Shao, B.: An efficient heuristic for broadcasting in networks. J. Parallel Distrib. Comput.\u00a066(1), 68\u201376 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Harutyunyan, H.A., Wang, W.: Broadcasting algorithm via shortest paths. In: Proceedings of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems (ICPADS 2010), pp. 299\u2013305 (2010)","DOI":"10.1109\/ICPADS.2010.110"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00230-G","volume":"147","author":"K. Jansen","year":"1995","unstructured":"Jansen, K., Muller, H.: The minimum broadcast time problem for several processor networks. Theoretical Computer Science\u00a0147, 69\u201385 (1995)","journal-title":"Theoretical Computer Science"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895480193245923","volume":"8","author":"G. Kortsarz","year":"1995","unstructured":"Kortsarz, G., Peleg, D.: Approximation algorithms for minimum time broadcast. SIAM J. Discrete Math.\u00a08, 401\u2013427 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(93)90066-I","volume":"46","author":"M. Middendorf","year":"1993","unstructured":"Middendorf, M.: Minimum broadcast time is np-complete for 3-regular planar graphs and deadline 2. Inf. Proc. Lett.\u00a046, 281\u2013287 (1993)","journal-title":"Inf. Proc. Lett."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Ravi, R.: Rapid rumor ramification: approximating the minimum broadcast time. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 202\u2013213 (1994)","DOI":"10.1109\/SFCS.1994.365693"},{"issue":"9","key":"3_CR17","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TC.1984.1676496","volume":"33","author":"P. Scheuermann","year":"1984","unstructured":"Scheuermann, P., Wu, G.: Heuristic algorithms for broadcasting in point-to-point computer networks. IEEE Trans. Comput.\u00a033(9), 804\u2013811 (1984)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-44436-X_23","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"C. Schindelhauer","year":"2000","unstructured":"Schindelhauer, C.: On the inapproximability of broadcasting time. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 226\u2013237. Springer, Heidelberg (2000)"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"P.J. Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput.\u00a010(4), 692\u2013701 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T21:40:26Z","timestamp":1747518026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}