{"id":"https://openalex.org/W2063761894","doi":"https://doi.org/10.1007/s10878-005-4925-3","title":"An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes","display_name":"An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes","publication_year":2005,"publication_date":"2005-11-16","ids":{"openalex":"https://openalex.org/W2063761894","doi":"https://doi.org/10.1007/s10878-005-4925-3","mag":"2063761894"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-005-4925-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-4925-3","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/A5065527161","display_name":"Longjiang Guo","orcid":"https://orcid.org/0000-0003-0720-2505"},"institutions":[{"id":"https://openalex.org/I4390039265","display_name":"PRG S&Tech (South Korea)","ror":"https://ror.org/02sr2ee22","country_code":null,"type":"company","lineage":["https://openalex.org/I4390039265"]},{"id":"https://openalex.org/I4210161462","display_name":"Heilongjiang Institute of Technology","ror":"https://ror.org/05x0m9n95","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210161462"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Longjiang Guo","raw_affiliation_strings":["Institute of Computer Science and Technology, Harbin, HeiLongJiang, China, 150001","School of Computer Science and Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Technology, Harbin, HeiLongJiang, China, 150001","institution_ids":["https://openalex.org/I4210161462"]},{"raw_affiliation_string":"School of Computer Science and Technology","institution_ids":["https://openalex.org/I4390039265"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070037321","display_name":"Weili Wu","orcid":"https://orcid.org/0000-0001-8747-6340"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weili Wu","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083, USA","Department of Computer Science , University of Texas at Dallas, Richardson, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science , University of Texas at Dallas, Richardson, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100431362","display_name":"Feng Wang","orcid":"https://orcid.org/0000-0003-1427-5964"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Feng Wang","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA","University of\u00a0Minnesota"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005663679","display_name":"My T. Thai","orcid":"https://orcid.org/0000-0003-0503-2012"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"My Thai","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA","University of\u00a0Minnesota"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5065527161"],"corresponding_institution_ids":["https://openalex.org/I4210161462","https://openalex.org/I4390039265"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15295586,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":"4","first_page":"391","last_page":"394"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"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/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"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/T10232","display_name":"Optical Network Technologies","score":0.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8324705958366394},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.8090388774871826},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6026262640953064},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5625273585319519},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4996309280395508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4910593032836914},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4885762631893158},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44832319021224976},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.41590026021003723},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41431695222854614},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40993112325668335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39578601717948914},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.14599305391311646},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.14053574204444885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1386336088180542},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.11461043357849121},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06733494997024536}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8324705958366394},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8090388774871826},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6026262640953064},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5625273585319519},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4996309280395508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4910593032836914},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4885762631893158},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44832319021224976},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.41590026021003723},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41431695222854614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40993112325668335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39578601717948914},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.14599305391311646},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.14053574204444885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1386336088180542},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.11461043357849121},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06733494997024536}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-005-4925-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-4925-3","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:10:y:2005:i:4:d:10.1007_s10878-005-4925-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-005-4925-3","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":6,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W1990327548","https://openalex.org/W1996133549","https://openalex.org/W2011039300","https://openalex.org/W2016053525","https://openalex.org/W2476096155"],"related_works":["https://openalex.org/W1980288485","https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W3184075718","https://openalex.org/W1998126097","https://openalex.org/W2404561224","https://openalex.org/W2162201886","https://openalex.org/W1533142511","https://openalex.org/W2112839770","https://openalex.org/W4388857710"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}