{"id":"https://openalex.org/W1983209774","doi":"https://doi.org/10.1142/s0129054112500232","title":"APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM","display_name":"APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W1983209774","doi":"https://doi.org/10.1142/s0129054112500232","mag":"1983209774"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054112500232","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112500232","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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/A5005241000","display_name":"Chung-Shou Liao","orcid":"https://orcid.org/0000-0001-9196-4478"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"CHUNG-SHOU LIAO","raw_affiliation_strings":["Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan","Department of Industrial Engineering & Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Department of Industrial Engineering & Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan#TAB#","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012300835","display_name":"Louxin Zhang","orcid":"https://orcid.org/0000-0003-0260-824X"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"LOUXIN ZHANG","raw_affiliation_strings":["Department of Mathematics, National University of Singapore, 10 Lower Kent Ridge Road, Singapore 119076, Singapore","Department of Mathematics, National University of Singapore, 10, Lower Kent Ridge Road, Singapore 119076, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, National University of Singapore, 10 Lower Kent Ridge Road, Singapore 119076, Singapore","institution_ids":["https://openalex.org/I165932596"]},{"raw_affiliation_string":"Department of Mathematics, National University of Singapore, 10, Lower Kent Ridge Road, Singapore 119076, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07455533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"07","first_page":"1543","last_page":"1554"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T11106","display_name":"Data Management and Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7735006809234619},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7470470666885376},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.7299597263336182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.63788241147995},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6134340167045593},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6061385273933411},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5921544432640076},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5466856956481934},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.5089747905731201},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4509791433811188},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.43970975279808044},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.43310976028442383},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.43188226222991943},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42901769280433655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36220747232437134},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.35089629888534546},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18581128120422363},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14943534135818481},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06300196051597595}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7735006809234619},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7470470666885376},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.7299597263336182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.63788241147995},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6134340167045593},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6061385273933411},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5921544432640076},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5466856956481934},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.5089747905731201},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4509791433811188},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.43970975279808044},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.43310976028442383},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.43188226222991943},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42901769280433655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36220747232437134},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.35089629888534546},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18581128120422363},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14943534135818481},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06300196051597595},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054112500232","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112500232","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/104491","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/104491","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W170534829","https://openalex.org/W1599028340","https://openalex.org/W1830560292","https://openalex.org/W1983741169","https://openalex.org/W1988615825","https://openalex.org/W2004860288","https://openalex.org/W2014686215","https://openalex.org/W2022548094","https://openalex.org/W2023454821","https://openalex.org/W2029448190","https://openalex.org/W2059372025","https://openalex.org/W2096389124","https://openalex.org/W2100961486","https://openalex.org/W2101692623","https://openalex.org/W2115435070","https://openalex.org/W2133372967"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1997570556","https://openalex.org/W3016811403","https://openalex.org/W2059360098","https://openalex.org/W1983511657","https://openalex.org/W2387385213","https://openalex.org/W2048177396","https://openalex.org/W1576317141","https://openalex.org/W3081212354","https://openalex.org/W2149927264"],"abstract_inverted_index":{"The":[0],"spanning":[1,22,32],"star":[2],"forest":[3,24,33],"problem":[4,9,64],"is":[5,27,90],"an":[6],"interesting":[7],"algorithmic":[8],"in":[10,34,46,73],"combinatorial":[11],"optimization":[12],"and":[13,43,79],"finds":[14],"different":[15],"applications.":[16],"We":[17,59],"generalize":[18],"it":[19],"into":[20],"the":[21,47,56,83],"k-tree":[23],"problem,":[25],"which":[26,35],"to":[28],"find":[29],"a":[30,40,87],"maximum":[31],"each":[36],"tree":[37],"component":[38,48],"has":[39],"central":[41,57],"vertex":[42],"other":[44],"vertices":[45],"have":[49],"distance":[50,85],"at":[51],"most":[52],"k":[53],"away":[54],"from":[55],"vertex.":[58],"show":[60],"that":[61],"this":[62],"new":[63],"can":[65],"be":[66],"approximated":[67],"with":[68],"ratio":[69],"[Formula:":[70],"see":[71],"text]":[72],"polynomial":[74],"time":[75],"for":[76,92],"both":[77],"undirected":[78],"directed":[80],"graphs.":[81],"In":[82],"weighted":[84],"model,":[86],"\u00bd-approximation":[88],"algorithm":[89],"presented":[91],"it.":[93]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}