{"id":"https://openalex.org/W2124118822","doi":"https://doi.org/10.1142/s0219265908002205","title":"COST-CONSTRAINED MINIMUM-DELAY MULTICASTING","display_name":"COST-CONSTRAINED MINIMUM-DELAY MULTICASTING","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2124118822","doi":"https://doi.org/10.1142/s0219265908002205","mag":"2124118822"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265908002205","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265908002205","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5065870863","display_name":"Satoshi Tayu","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"SATOSHI TAYU","raw_affiliation_strings":["Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053424697","display_name":"Turki Ghazi Al-Mutairi","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"TURKI GHAZI AL-MUTAIRI","raw_affiliation_strings":["Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089756558","display_name":"Shuichi Ueno","orcid":"https://orcid.org/0000-0002-2611-962X"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"SHUICHI UENO","raw_affiliation_strings":["Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-S3-57, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3814,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.70274927,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"09","issue":"01n02","first_page":"141","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9994999766349792,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.7549042105674744},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.7240027189254761},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6162382364273071},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5875232219696045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5579062104225159},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5514689683914185},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5309519171714783},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5170915126800537},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5102622509002686},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.5027320384979248},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.47944942116737366},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.47278687357902527},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41591811180114746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.348923921585083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3034334182739258},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2866787910461426},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2218416929244995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15299195051193237}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7549042105674744},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7240027189254761},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6162382364273071},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5875232219696045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5579062104225159},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5514689683914185},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5309519171714783},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5170915126800537},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5102622509002686},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.5027320384979248},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.47944942116737366},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.47278687357902527},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41591811180114746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.348923921585083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3034334182739258},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2866787910461426},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2218416929244995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15299195051193237},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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":1,"locations":[{"id":"doi:10.1142/s0219265908002205","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265908002205","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2015841735","https://openalex.org/W2022258268","https://openalex.org/W2039021074","https://openalex.org/W2048013200","https://openalex.org/W2066047491","https://openalex.org/W2074117023","https://openalex.org/W2130626677","https://openalex.org/W2152950844"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1584380088"],"abstract_inverted_index":{"We":[0,67],"consider":[1],"a":[2,9,15,31,38,55,69],"problem":[3,58,77],"of":[4,46],"cost-constrained":[5],"minimum-delay":[6],"multicasting":[7],"in":[8,49],"network,":[10],"which":[11],"is":[12,41,52,59,65,81],"to":[13,37],"find":[14],"Steiner":[16],"tree":[17,51],"spanning":[18],"the":[19,26,34,44,50,63,76,79],"source":[20,35],"and":[21],"destination":[22,39],"nodes":[23],"such":[24],"that":[25],"maximum":[27],"total":[28],"delay":[29],"along":[30],"path":[32],"from":[33],"node":[36,40],"minimized,":[42],"while":[43],"sum":[45],"link":[47],"costs":[48],"bounded":[53],"by":[54],"constant.":[56],"The":[57],"NP-hard":[60],"even":[61],"if":[62,78],"network":[64,80],"series-parallel.":[66,82],"present":[68],"fully":[70],"polynomial":[71],"time":[72],"approximation":[73],"scheme":[74],"for":[75]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}