{"id":"https://openalex.org/W1559707664","doi":"https://doi.org/10.1109/icpp.2002.1040908","title":"Worst case analysis of a greedy multicast algorithm in k-ary n-cubes","display_name":"Worst case analysis of a greedy multicast algorithm in k-ary n-cubes","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1559707664","doi":"https://doi.org/10.1109/icpp.2002.1040908","mag":"1559707664"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2002.1040908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Conference on Parallel Processing","raw_type":"proceedings-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/A5087923932","display_name":"Satoshi Fujita","orcid":"https://orcid.org/0000-0001-9412-7309"},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"S. Fujita","raw_affiliation_strings":["Graduate School of Engineering, Hirohshima University, Higashihiroshima, Japan","Graduate School of Engineering Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Hirohshima University, Higashihiroshima, Japan","institution_ids":[]},{"raw_affiliation_string":"Graduate School of Engineering Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087923932"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08880702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":null,"first_page":"511","last_page":"518"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9990000128746033,"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.9984999895095825,"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.7981477975845337},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6221259832382202},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6011472940444946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5708335041999817},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5688057541847229},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5603457093238831},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5417270660400391},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46729782223701477},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4661250114440918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4349524974822998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43004661798477173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3984871506690979},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07918590307235718}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7981477975845337},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6221259832382202},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6011472940444946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5708335041999817},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5688057541847229},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5603457093238831},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5417270660400391},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46729782223701477},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4661250114440918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4349524974822998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43004661798477173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3984871506690979},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07918590307235718}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpp.2002.1040908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W4906907","https://openalex.org/W104124374","https://openalex.org/W1888089383","https://openalex.org/W1946493750","https://openalex.org/W1970458206","https://openalex.org/W1986112324","https://openalex.org/W2061827157","https://openalex.org/W2088523482","https://openalex.org/W2101000651","https://openalex.org/W2116410829","https://openalex.org/W2150648486","https://openalex.org/W2154323564","https://openalex.org/W2159687416","https://openalex.org/W2165833729","https://openalex.org/W2275333073","https://openalex.org/W2469728496","https://openalex.org/W6600184713","https://openalex.org/W6604216885","https://openalex.org/W6640657644"],"related_works":["https://openalex.org/W1898478360","https://openalex.org/W2387385213","https://openalex.org/W1492843964","https://openalex.org/W2758610492","https://openalex.org/W3016811403","https://openalex.org/W3023158453","https://openalex.org/W2005362242","https://openalex.org/W2951475756","https://openalex.org/W2270553684","https://openalex.org/W224481465"],"abstract_inverted_index":{"In":[0,52],"this":[1],"paper,":[2],"we":[3,55],"consider":[4],"the":[5,15,21,26,29,35,41,43,46,49,53,70,78,80,84,93,100,107,112,115,120,125,128,132,149,153],"problem":[6,22],"of":[7,20,28,77,83,92,95,114,119,124,127,134,152],"multicasting":[8],"a":[9,62,66,89,103],"message":[10],"in":[11,48,65,69,88,102,117],"k-ary":[12],"n-cubes":[13],"under":[14],"store-and-forward":[16],"model.":[17],"The":[18],"objective":[19],"is":[23,139,156],"to":[24,37,106,131],"minimize":[25],"size":[27,126,133],"resultant":[30],"multicast":[31,63],"tree":[32,42,64,130],"by":[33],"keeping":[34],"distance":[36,47],"each":[38,74],"destination":[39],"over":[40],"same":[44],"as":[45],"original":[50],"graph.":[51],"following,":[54],"first":[56],"propose":[57],"an":[58,135],"algorithm":[59,116,155],"that":[60,72,97,141],"grows":[61],"greedy":[67,154],"manner,":[68],"sense":[71],"for":[73,142,159],"intermediate":[75],"vertex":[76,85],"tree,":[79],"outgoing":[81],"edges":[82],"are":[86],"selected":[87],"non-increasing":[90],"order":[91],"number":[94],"destinations":[96],"can":[98],"use":[99],"edge":[101],"shortest":[104],"path":[105],"destination.":[108],"We":[109],"then":[110],"evaluate":[111],"goodness":[113],"terms":[118],"worst":[121],"case":[122],"ratio":[123,151],"generated":[129],"optimal":[136],"tree.":[137],"It":[138],"proved":[140],"any":[143],"k/spl":[144],"ges/5":[145],"and":[146],"n/spl":[147],"ges/6,":[148],"performance":[150],"c/spl":[157],"times/kn-o(n)":[158],"some":[160],"constant":[161],"1/1.2/spl":[162],"les/c/spl":[163],"les/1/2.":[164]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}