{"id":"https://openalex.org/W2901018354","doi":"https://doi.org/10.1016/j.tcs.2018.11.008","title":"A PTAS for the metric case of the optimum weighted source\u2013destination communication spanning tree problem","display_name":"A PTAS for the metric case of the optimum weighted source\u2013destination communication spanning tree problem","publication_year":2018,"publication_date":"2018-11-14","ids":{"openalex":"https://openalex.org/W2901018354","doi":"https://doi.org/10.1016/j.tcs.2018.11.008","mag":"2901018354"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2018.11.008","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2018.11.008","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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/A5083541706","display_name":"Santiago V. Ravelo","orcid":"https://orcid.org/0000-0001-7434-2642"},"institutions":[{"id":"https://openalex.org/I126460647","display_name":"Universidade Federal do Rio Grande","ror":"https://ror.org/05hpfkn88","country_code":"BR","type":"education","lineage":["https://openalex.org/I126460647"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Santiago Vald\u00e9s Ravelo","raw_affiliation_strings":["Center of Computer Sciences, Federal University of Rio Grande, Brazil"],"raw_orcid":"https://orcid.org/0000-0001-7434-2642","affiliations":[{"raw_affiliation_string":"Center of Computer Sciences, Federal University of Rio Grande, Brazil","institution_ids":["https://openalex.org/I126460647"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103212438","display_name":"Carlos Eduardo Ferreira","orcid":"https://orcid.org/0000-0003-4804-5788"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Carlos Eduardo Ferreira","raw_affiliation_strings":["Institute of Mathematics and Statistics, University of Sao Paulo, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Statistics, University of Sao Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083541706"],"corresponding_institution_ids":["https://openalex.org/I126460647"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17625104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"771","issue":null,"first_page":"9","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7752774953842163},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7128067016601562},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.687574028968811},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6756229400634766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6628844738006592},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5964179635047913},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5601661801338196},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5499125719070435},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5323460698127747},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4995920658111572},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.488533616065979},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4841811954975128},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4836333990097046},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.48325735330581665},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4580468535423279},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.42359471321105957},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.41558638215065},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41169536113739014},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2716864347457886},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1947254240512848}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7752774953842163},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7128067016601562},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.687574028968811},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6756229400634766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6628844738006592},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5964179635047913},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5601661801338196},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5499125719070435},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5323460698127747},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4995920658111572},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.488533616065979},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4841811954975128},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4836333990097046},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.48325735330581665},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4580468535423279},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.42359471321105957},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.41558638215065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41169536113739014},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2716864347457886},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1947254240512848},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2018.11.008","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2018.11.008","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W171992297","https://openalex.org/W578701171","https://openalex.org/W1531368347","https://openalex.org/W1983995412","https://openalex.org/W1999704039","https://openalex.org/W2003847232","https://openalex.org/W2016218947","https://openalex.org/W2030860466","https://openalex.org/W2030879379","https://openalex.org/W2047517090","https://openalex.org/W2076522498","https://openalex.org/W2082353536","https://openalex.org/W2114493937","https://openalex.org/W2156036190","https://openalex.org/W2169528473","https://openalex.org/W2537053653","https://openalex.org/W2811369196","https://openalex.org/W3138832177","https://openalex.org/W4245266864","https://openalex.org/W6677331748","https://openalex.org/W6752802924"],"related_works":["https://openalex.org/W1964611452","https://openalex.org/W2090857456","https://openalex.org/W3155900666","https://openalex.org/W4287235520","https://openalex.org/W1569529368","https://openalex.org/W1754127855","https://openalex.org/W1516991388","https://openalex.org/W1541747286","https://openalex.org/W1514905840","https://openalex.org/W2901018354"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2018-11-29T00:00:00"}