{"id":"https://openalex.org/W1991192327","doi":"https://doi.org/10.1137/s0097539798347906","title":"Message Multicasting in Heterogeneous Networks","display_name":"Message Multicasting in Heterogeneous Networks","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1991192327","doi":"https://doi.org/10.1137/s0097539798347906","mag":"1991192327"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798347906","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798347906","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050059210","display_name":"Amotz Bar-Noy","orcid":"https://orcid.org/0009-0004-7021-9072"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amotz Bar-Noy","raw_affiliation_strings":["IBM, ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6176,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.90615376,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"30","issue":"2","first_page":"347","last_page":"358"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.8906996846199036},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6507449746131897},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6218584775924683},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6218203902244568},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5425288677215576},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5338315367698669},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48305660486221313},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4457119107246399},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4151046872138977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38338539004325867},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33510303497314453},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3133668303489685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27574068307876587},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07389813661575317}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8906996846199036},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6507449746131897},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6218584775924683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6218203902244568},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5425288677215576},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5338315367698669},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48305660486221313},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4457119107246399},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4151046872138977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38338539004325867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33510303497314453},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3133668303489685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27574068307876587},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07389813661575317},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539798347906","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798347906","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.6929","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.6929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~sudipto/mypapers/multicast.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1578934802","https://openalex.org/W1971077560","https://openalex.org/W2000563081","https://openalex.org/W2003701033","https://openalex.org/W2057463582","https://openalex.org/W2058322021","https://openalex.org/W2058721985","https://openalex.org/W2064779029","https://openalex.org/W2068738660","https://openalex.org/W2069435071","https://openalex.org/W2083990694","https://openalex.org/W2091912668","https://openalex.org/W3201199382"],"related_works":["https://openalex.org/W2059838946","https://openalex.org/W2129429594","https://openalex.org/W2352855795","https://openalex.org/W1984532438","https://openalex.org/W2060162472","https://openalex.org/W2275325805","https://openalex.org/W2569940161","https://openalex.org/W1991192327","https://openalex.org/W3115255814","https://openalex.org/W3183323092"],"abstract_inverted_index":{"In":[0],"heterogeneous":[1],"networks,":[2],"sending":[3],"messages":[4],"may":[5,15],"incur":[6],"different":[7,10,18],"delays":[8,32],"on":[9,97],"links,":[11],"and":[12,33],"each":[13],"node":[14],"have":[16],"a":[17,53,59,79,89,108],"switching":[19,34],"time":[20,49,87],"between":[21],"messages.":[22],"The":[23,67],"well-studied":[24],"telephone":[25,75,105],"model":[26,106,122],"is":[27,69],"obtained":[28],"when":[29],"all":[30],"link":[31],"times":[35],"are":[36],"equal":[37],"to":[38,51,58],"one":[39,56],"unit.":[40],"We":[41,77],"investigate":[42],"the":[43,47,62,73,84,98,104,120],"problem":[44,68],"of":[45,61,64,91,110],"finding":[46],"minimum":[48,85],"required":[50],"multicast":[52,86],"message":[54],"from":[55],"source":[57],"subset":[60],"nodes":[63],"size":[65],"k.":[66],"NP-hard":[70],"even":[71],"in":[72,124],"basic":[74],"model.":[76],"present":[78],"polynomial-time":[80],"algorithm":[81,95],"that":[82],"approximates":[83],"within":[88],"factor":[90,102,109],"O(log":[92],"k).":[93],"Our":[94],"improves":[96],"best":[99],"known":[100,118],"approximation":[101,115],"for":[103,119],"by":[107],"$O(\\frac{\\log":[111],"n}{\\log\\log":[112],"k})$.":[113],"No":[114],"algorithms":[116],"were":[117],"general":[121],"considered":[123],"this":[125],"paper.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}