{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:28:15Z","timestamp":1750094895941},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,26]],"date-time":"2012-04-26T00:00:00Z","timestamp":1335398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10878-012-9493-8","type":"journal-article","created":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T14:50:07Z","timestamp":1335365407000},"page":"602-616","source":"Crossref","is-referenced-by-count":4,"title":["The broadcast median problem in heterogeneous postal model"],"prefix":"10.1007","volume":"25","author":[{"given":"Cheng-Hsiao","family":"Tsou","sequence":"first","affiliation":[]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Hung-I","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Ching-Chi","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,26]]},"reference":[{"issue":"5","key":"9493_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF01184933","volume":"27","author":"A Bar-Noy","year":"1994","unstructured":"Bar-Noy A, Kipnis S (1994) Designing broadcasting algorithms in the postal model for message-passing systems. Math Syst Theory 27(5):431\u2013452","journal-title":"Math Syst Theory"},{"issue":"1","key":"9493_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1097-0037(199701)29:1<1::AID-NET1>3.0.CO;2-P","volume":"29","author":"A Bar-Noy","year":"1997","unstructured":"Bar-Noy A, Kipnis S (1997) Multiple message broadcasting in the postal model. Networks 29(1):1\u201310","journal-title":"Networks"},{"issue":"2","key":"9493_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/S0097539798347906","volume":"30","author":"A Bar-Noy","year":"2000","unstructured":"Bar-Noy A, Guha S, Naor J, Schieber B (2000) Message multicasting in heterogeneous networks. SIAM J Comput 30(2):347\u2013358","journal-title":"SIAM J Comput"},{"issue":"2","key":"9493_CR4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0139032","volume":"39","author":"AM Farley","year":"1980","unstructured":"Farley AM (1980) Broadcast time in communication networks. SIAM J Appl Math 39(2):385\u2013390","journal-title":"SIAM J Appl Math"},{"issue":"4","key":"9493_CR5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi SM, Hedetniemi ST, Liestman AL (1988) A survey of gossiping and broadcasting in communication networks. Networks 18(4):319\u2013349","journal-title":"Networks"},{"key":"9493_CR6","first-page":"85","volume-title":"Complexity of computer computations, Proc sympos, IBM Thomas J Watson Res Center, Yorktown Heights, NY, 1972","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations, Proc sympos, IBM Thomas J Watson Res Center, Yorktown Heights, NY, 1972. Plenum, New York, pp 85\u2013103"},{"issue":"1","key":"9493_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-006-1227-9","volume":"48","author":"S Khuller","year":"2007","unstructured":"Khuller S, Kim YA (2007) Broadcasting in heterogeneous networks. Algorithmica 48(1):1\u201321","journal-title":"Algorithmica"},{"issue":"2","key":"9493_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.jalgor.2005.01.002","volume":"59","author":"S Khuller","year":"2006","unstructured":"Khuller S, Kim YA, Wan YC (2006) On generalized gossiping and broadcasting. J Algorithms 59(2):81\u2013106","journal-title":"J Algorithms"},{"issue":"3","key":"9493_CR9","first-page":"1","volume":"52","author":"S Khuller","year":"2008","unstructured":"Khuller S, Kim YA, Wan YC (2008) Broadcasting on networks of workstations. Algorithmica 52(3):1\u201321","journal-title":"Algorithmica"},{"issue":"10","key":"9493_CR10","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1109\/12.93751","volume":"40","author":"JM Koh","year":"1991","unstructured":"Koh JM, Tcha DW (1991) Information dissemination in trees with nonuniform edge transmission times. IEEE Trans Comput 40(10):1174\u20131177","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"9493_CR11","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0166-218X(92)90010-8","volume":"40","author":"HM Lee","year":"1992","unstructured":"Lee HM, Chang GJ (1992) Set to set broadcasting in communication networks. Discrete Appl Math 40(3):411\u2013421","journal-title":"Discrete Appl Math"},{"issue":"2","key":"9493_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230180205","volume":"18","author":"D Richards","year":"1988","unstructured":"Richards D, Liestman AL (1988) Generalizations of broadcasting and gossiping. Networks 18(2):125\u2013138","journal-title":"Networks"},{"issue":"4","key":"9493_CR13","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"PJ Slater","year":"1981","unstructured":"Slater PJ, Cockayne EJ, Hedetniemi ST (1981) Information dissemination in trees. SIAM J Comput 10(4):692\u2013701","journal-title":"SIAM J Comput"},{"key":"9493_CR14","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-642-14031-0_40","volume-title":"Proceedings of the 16th annual international conference on computing and combinatorics, COCOON\u201910","author":"YH Su","year":"2010","unstructured":"Su YH, Lin CC, Lee DT (2010) Broadcasting in heterogeneous tree networks. In: Proceedings of the 16th annual international conference on computing and combinatorics, COCOON\u201910. Springer, Berlin, pp\u00a0368\u2013377"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9493-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9493-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9493-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:18Z","timestamp":1559262198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9493-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,26]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9493"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9493-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,26]]}}}