{"id":"https://openalex.org/W3163086542","doi":"https://doi.org/10.1007/978-3-030-72792-5_24","title":"Approximation Algorithms for the Balanced Optimization Splicing Problem in Undirected Graph","display_name":"Approximation Algorithms for the Balanced Optimization Splicing Problem in Undirected Graph","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3163086542","doi":"https://doi.org/10.1007/978-3-030-72792-5_24","mag":"3163086542"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-72792-5_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-72792-5_24","pdf_url":null,"source":{"id":"https://openalex.org/S4393917809","display_name":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","issn_l":"1867-8211","issn":["1867-8211","1867-822X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","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/A5026870328","display_name":"Yongsong Wen","orcid":"https://orcid.org/0000-0003-2170-8414"},"institutions":[{"id":"https://openalex.org/I170172562","display_name":"Guizhou University of Finance and Economics","ror":"https://ror.org/02sw6yz40","country_code":"CN","type":"education","lineage":["https://openalex.org/I170172562"]},{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yongsong Wen","raw_affiliation_strings":["School of Management, Wuhan University of Technology, Wuhan, People\u2019s Republic of China","School of Mathematics and Statistics, GuiZhou University of Finance and Economics, Guiyang, People\u2019s Republic of China","School of Mathematics and Statistics, GuiZhou University of Finance and Economics, Guiyang, People's Republic of China","School of Management, Wuhan University of Technology, Wuhan, People's Republic of China"],"affiliations":[{"raw_affiliation_string":"School of Management, Wuhan University of Technology, Wuhan, People\u2019s Republic of China","institution_ids":["https://openalex.org/I196699116"]},{"raw_affiliation_string":"School of Mathematics and Statistics, GuiZhou University of Finance and Economics, Guiyang, People\u2019s Republic of China","institution_ids":["https://openalex.org/I170172562"]},{"raw_affiliation_string":"School of Mathematics and Statistics, GuiZhou University of Finance and Economics, Guiyang, People's Republic of China","institution_ids":["https://openalex.org/I170172562"]},{"raw_affiliation_string":"School of Management, Wuhan University of Technology, Wuhan, People's Republic of China","institution_ids":["https://openalex.org/I196699116"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026870328"],"corresponding_institution_ids":["https://openalex.org/I170172562","https://openalex.org/I196699116"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10421743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"263","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7034979462623596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6325646042823792},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6246247291564941},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.590710461139679},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4954293966293335},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4649924337863922},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4442501962184906},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.43548133969306946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28230148553848267}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7034979462623596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6325646042823792},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6246247291564941},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.590710461139679},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4954293966293335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4649924337863922},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4442501962184906},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.43548133969306946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28230148553848267}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-72792-5_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-72792-5_24","pdf_url":null,"source":{"id":"https://openalex.org/S4393917809","display_name":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","issn_l":"1867-8211","issn":["1867-8211","1867-822X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1980404490","https://openalex.org/W1984863471","https://openalex.org/W1999004550","https://openalex.org/W2008284829","https://openalex.org/W2013863738","https://openalex.org/W2066586043","https://openalex.org/W2069323107","https://openalex.org/W2072262874","https://openalex.org/W2075323586","https://openalex.org/W2078701526","https://openalex.org/W2081860686","https://openalex.org/W2084809756","https://openalex.org/W2092671842","https://openalex.org/W2323566888","https://openalex.org/W4241786443","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W2081066931"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}