{"id":"https://openalex.org/W1991032379","doi":"https://doi.org/10.1016/s0166-218x(03)00262-2","title":"Multi-source spanning trees: algorithms for minimizing source eccentricities","display_name":"Multi-source spanning trees: algorithms for minimizing source eccentricities","publication_year":2003,"publication_date":"2003-09-12","ids":{"openalex":"https://openalex.org/W1991032379","doi":"https://doi.org/10.1016/s0166-218x(03)00262-2","mag":"1991032379"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(03)00262-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(03)00262-2","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5040311844","display_name":"H. Brendan McMahan","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H.Brendan McMahan","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA 15213, USA","Carnegie-Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","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":true,"raw_author_name":"Andrzej Proskurowski","raw_affiliation_strings":["University of Oregon, Eugene, OR 97403, USA","University of Oregon, Eugene OR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oregon, Eugene, OR 97403, USA","institution_ids":["https://openalex.org/I181233156"]},{"raw_affiliation_string":"University of Oregon, Eugene OR","institution_ids":["https://openalex.org/I181233156"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082277472"],"corresponding_institution_ids":["https://openalex.org/I181233156"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":2.1249,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86820624,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"137","issue":"2","first_page":"213","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9860000014305115,"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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9787999987602234,"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.8308383226394653},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6779293417930603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6477072238922119},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5208821296691895},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4992854595184326},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49353134632110596},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4806860387325287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4779101312160492},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.46496301889419556},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.44939500093460083},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4447661340236664}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8308383226394653},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6779293417930603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6477072238922119},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5208821296691895},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4992854595184326},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49353134632110596},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4806860387325287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4779101312160492},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.46496301889419556},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.44939500093460083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4447661340236664}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(03)00262-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(03)00262-2","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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":13,"referenced_works":["https://openalex.org/W1991032379","https://openalex.org/W2003847232","https://openalex.org/W2008014328","https://openalex.org/W2016218947","https://openalex.org/W2030879379","https://openalex.org/W2039281020","https://openalex.org/W2047517090","https://openalex.org/W2120636801","https://openalex.org/W2147258429","https://openalex.org/W2169083050","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W6678158087"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W2589768050","https://openalex.org/W2387385213","https://openalex.org/W2138987445","https://openalex.org/W3016811403","https://openalex.org/W2390742649","https://openalex.org/W88291963","https://openalex.org/W2099915933","https://openalex.org/W2281826919"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}