{"id":"https://openalex.org/W1519701903","doi":"https://doi.org/10.1142/s0219265900000056","title":"MULTI-SOURCE SPANNING TREE PROBLEMS","display_name":"MULTI-SOURCE SPANNING TREE PROBLEMS","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W1519701903","doi":"https://doi.org/10.1142/s0219265900000056","mag":"1519701903"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265900000056","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265900000056","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/A5110018424","display_name":"Arthur M. Farley","orcid":null},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ARTHUR M. FARLEY","raw_affiliation_strings":["Computer and Information Science Department, University of Oregon, Eugene, OR 97403, USA"],"affiliations":[{"raw_affiliation_string":"Computer and Information Science Department, University of Oregon, Eugene, OR 97403, USA","institution_ids":["https://openalex.org/I181233156"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047117000","display_name":"Paraskevi Fragopoulou","orcid":"https://orcid.org/0000-0002-7134-9029"},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"PARASKEVI FRAGOPOULOU","raw_affiliation_strings":["Laboratoire de Recherche en Informatique Universit\u00e9 Paris Sud, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique Universit\u00e9 Paris Sud, France","institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I102197404"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083263074","display_name":"David W. Krumme","orcid":null},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DAVID KRUMME","raw_affiliation_strings":["Computer Science Department, Tufts University, Medford, MA 02155, USA","Computer Science Department, Tufts University, Medford, MA 02155, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Tufts University, Medford, MA 02155, USA","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"Computer Science Department, Tufts University, Medford, MA 02155, USA#TAB#","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082277472","display_name":"Andrzej Proskurowski","orcid":null},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ANDRZEJ PROSKUROWSKI","raw_affiliation_strings":["Computer and Information Science Department, University of Oregon, Eugene, OR 97403, USA"],"affiliations":[{"raw_affiliation_string":"Computer and Information Science Department, University of Oregon, Eugene, OR 97403, USA","institution_ids":["https://openalex.org/I181233156"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036610989","display_name":"Dana Richards","orcid":"https://orcid.org/0000-0002-7260-4394"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DANA RICHARDS","raw_affiliation_strings":["Computer Science Department, George Mason University, 400 University Drive, Fairfax, VA 22030-4444, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, George Mason University, 400 University Drive, Fairfax, VA 22030-4444, USA","institution_ids":["https://openalex.org/I162714631"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5110018424"],"corresponding_institution_ids":["https://openalex.org/I181233156"],"apc_list":null,"apc_paid":null,"fwci":0.4144,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70427163,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"01","issue":"01","first_page":"61","last_page":"71"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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.998199999332428,"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/spanning-tree","display_name":"Spanning tree","score":0.7839369177818298},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.6504093408584595},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6290894746780396},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5609825253486633},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.552252471446991},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5066190958023071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48558205366134644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4595263600349426},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4489639103412628},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4381181001663208},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.40719711780548096},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3766300678253174},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3749954104423523},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1843254566192627},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.16943636536598206},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11409938335418701},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.10994207859039307}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7839369177818298},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.6504093408584595},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6290894746780396},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5609825253486633},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.552252471446991},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5066190958023071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48558205366134644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4595263600349426},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4489639103412628},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4381181001663208},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.40719711780548096},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3766300678253174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3749954104423523},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1843254566192627},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.16943636536598206},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11409938335418701},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.10994207859039307}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1142/s0219265900000056","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265900000056","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.3664","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.3664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uoregon.edu/~andrzej/pubs/join.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.2142","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.2142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://nrl.cs.uoregon.edu/pubs/uo-tr-99-02.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.1459","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.du.edu/~snarayan/sada/research/docs/uo-tr-99-02.pdf","raw_type":"text"},{"id":"mag:1519701903","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/sirocco/sirocco1999.html#FarleyFKPR99","pdf_url":null,"source":{"id":"https://openalex.org/S4306530060","display_name":"SIROCCO","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"SIROCCO","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1992847581","https://openalex.org/W2047517090","https://openalex.org/W4239852074"],"related_works":["https://openalex.org/W2104433301","https://openalex.org/W1828145824","https://openalex.org/W1550550959","https://openalex.org/W1535323908","https://openalex.org/W3027757481","https://openalex.org/W3193190408","https://openalex.org/W324086150","https://openalex.org/W2288157945","https://openalex.org/W1996778788","https://openalex.org/W2887969642","https://openalex.org/W2565378479","https://openalex.org/W2165327813","https://openalex.org/W2790633447","https://openalex.org/W1881540521","https://openalex.org/W2096201987","https://openalex.org/W2155406096","https://openalex.org/W2023425290","https://openalex.org/W2096320713","https://openalex.org/W156319294","https://openalex.org/W2937747829"],"abstract_inverted_index":{"We":[0,23,70,88,104,123],"consider":[1,42,106],"a":[2,8,21,121,131,143],"model":[3],"of":[4,20,38,45,55,61,96,110,120,128],"multicast":[5],"communication":[6],"in":[7,77,80],"network":[9,40],"whereby":[10],"multiple":[11],"sources":[12,30,65],"have":[13],"messages":[14,27],"to":[15,66,139],"disseminate":[16],"among":[17],"all":[18,29,64,67],"sites":[19],"network.":[22],"propose":[24],"that":[25,72,125],"the":[26,34,39,43,56,59,74,85,113,117,126],"from":[28,63],"are":[31],"disseminated":[32],"along":[33],"same":[35],"spanning":[36,114,134],"tree":[37,135],"and":[41,98,141],"problem":[44,127],"constructing":[46],"an":[47,107],"optimal":[48],"such":[49,130],"tree.":[50],"One":[51],"measure":[52,109],"for":[53,92,102,112],"suitability":[54],"construction":[57],"is":[58,136],"sum":[60],"distances":[62],"other":[68],"vertices.":[69],"show":[71,124],"finding":[73,129],"exact":[75],"solution":[76,145],"this":[78],"case":[79],"[Formula:":[81],"see":[82],"text]-hard":[83],"(in":[84],"strong":[86],"sense).":[87],"then":[89],"investigate":[90],"solutions":[91],"some":[93],"restricted":[94],"classes":[95],"graphs":[97],"give":[99,142],"efficient":[100],"algorithms":[101],"those.":[103],"also":[105],"alternative":[108],"goodness":[111],"tree,":[115],"being":[116],"maximum":[118],"eccentricity":[119,133],"source.":[122],"minimum":[132],"somewhat":[137],"easier":[138],"solve":[140],"pseudo-polynomial":[144],"algorithm.":[146]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}