{"id":"https://openalex.org/W2495279774","doi":"https://doi.org/10.1007/978-3-319-53925-6_30","title":"An Approximation Algorithm for Maximum Internal Spanning Tree","display_name":"An Approximation Algorithm for Maximum Internal Spanning Tree","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2495279774","doi":"https://doi.org/10.1007/978-3-319-53925-6_30","mag":"2495279774"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53925-6_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53925-6_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":["Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan"],"affiliations":[{"raw_affiliation_string":"Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan","institution_ids":["https://openalex.org/I165522056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074847389","display_name":"Youta Harada","orcid":null},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Youta Harada","raw_affiliation_strings":["Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan"],"affiliations":[{"raw_affiliation_string":"Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan","institution_ids":["https://openalex.org/I165522056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086589495","display_name":"Fei Guo","orcid":"https://orcid.org/0000-0002-7842-6840"},"institutions":[{"id":"https://openalex.org/I132369690","display_name":"Tianjin University of Science and Technology","ror":"https://ror.org/018rbtf37","country_code":"CN","type":"education","lineage":["https://openalex.org/I132369690"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fei Guo","raw_affiliation_strings":["School of Computer Science and Technology, Tianjin University, No. 135, Yaguan Road, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Tianjin University, No. 135, Yaguan Road, Tianjin, China","institution_ids":["https://openalex.org/I132369690"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065315257","display_name":"Lusheng Wang","orcid":"https://orcid.org/0000-0002-4344-8791"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lusheng Wang","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong SAR"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong SAR","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101483230"],"corresponding_institution_ids":["https://openalex.org/I165522056"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01708104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"385","last_page":"396"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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.9873999953269958,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9739999771118164,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6504830718040466},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6316471099853516},{"id":"https://openalex.org/keywords/mist","display_name":"Mist","score":0.620373010635376},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5799933671951294},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5500308275222778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5497156977653503},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5363003611564636},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5115350484848022},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5078333020210266},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4890206754207611},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4332830309867859},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.3152390122413635},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30113059282302856},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.29699206352233887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28973403573036194},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2731436491012573},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.24531960487365723},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11299332976341248}],"concepts":[{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6504830718040466},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6316471099853516},{"id":"https://openalex.org/C6831451","wikidata":"https://www.wikidata.org/wiki/Q192196","display_name":"Mist","level":2,"score":0.620373010635376},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5799933671951294},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5500308275222778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5497156977653503},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5363003611564636},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5115350484848022},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5078333020210266},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4890206754207611},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4332830309867859},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.3152390122413635},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30113059282302856},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.29699206352233887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28973403573036194},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2731436491012573},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.24531960487365723},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11299332976341248},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C153294291","wikidata":"https://www.wikidata.org/wiki/Q25261","display_name":"Meteorology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-53925-6_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53925-6_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Clean water and sanitation","score":0.8500000238418579,"id":"https://metadata.un.org/sdg/6"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W174078831","https://openalex.org/W231332773","https://openalex.org/W561119072","https://openalex.org/W1513252978","https://openalex.org/W1560611630","https://openalex.org/W1562509859","https://openalex.org/W1810979759","https://openalex.org/W1822472214","https://openalex.org/W1975444413","https://openalex.org/W1980860702","https://openalex.org/W1986398633","https://openalex.org/W2011039300","https://openalex.org/W2058133856","https://openalex.org/W2096147380","https://openalex.org/W2194898469","https://openalex.org/W2497553818","https://openalex.org/W2952317561"],"related_works":["https://openalex.org/W2130375301","https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W4380840098","https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W2418231958","https://openalex.org/W2381121915","https://openalex.org/W2109692093","https://openalex.org/W4206043061"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}