{"id":"https://openalex.org/W2081831441","doi":"https://doi.org/10.1007/s10878-005-1776-x","title":"An Improved Approximation Algorithm for Multicast k-Tree Routing","display_name":"An Improved Approximation Algorithm for Multicast k-Tree Routing","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W2081831441","doi":"https://doi.org/10.1007/s10878-005-1776-x","mag":"2081831441"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-005-1776-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1776-x","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","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/A5089344475","display_name":"Guohui Lin","orcid":"https://orcid.org/0000-0003-4283-3396"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Guohui Lin","raw_affiliation_strings":["Department of Computing Science, University of Alberta. Edmonton, Alberta, T6G 2E8, Canada","Department of Computing Science, University of Alberta.Edmonton, Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta. Edmonton, Alberta, T6G 2E8, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Department of Computing Science, University of Alberta.Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089344475"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.6973,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90416001,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"4","first_page":"349","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9975000023841858,"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.8192681074142456},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7983721494674683},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5993598699569702},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5830987691879272},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5290818810462952},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.515956699848175},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.47913309931755066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47449159622192383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3718636631965637},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3030608296394348},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2564559578895569},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.21272435784339905},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1800864040851593}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8192681074142456},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7983721494674683},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5993598699569702},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5830987691879272},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5290818810462952},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.515956699848175},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.47913309931755066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47449159622192383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3718636631965637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3030608296394348},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2564559578895569},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.21272435784339905},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1800864040851593}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-005-1776-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1776-x","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:9:y:2005:i:4:d:10.1007_s10878-005-1776-x","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-005-1776-x","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1481747612","https://openalex.org/W1519758470","https://openalex.org/W1551386151","https://openalex.org/W1990327548","https://openalex.org/W2011039300","https://openalex.org/W2045864518","https://openalex.org/W2096774592","https://openalex.org/W2101270523","https://openalex.org/W2109954492","https://openalex.org/W2122980048","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2362006006","https://openalex.org/W2009976792","https://openalex.org/W2021808862","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}