{"id":"https://openalex.org/W2966860303","doi":"https://doi.org/10.1007/978-3-030-27195-4_19","title":"A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties","display_name":"A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2966860303","doi":"https://doi.org/10.1007/978-3-030-27195-4_19","mag":"2966860303"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-27195-4_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-27195-4_19","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/A5100373390","display_name":"Xiaofei Liu","orcid":"https://orcid.org/0000-0002-1650-2625"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaofei Liu","raw_affiliation_strings":["School of Electronic Engineering and Computer Science, Peking University, Beijing, 100871, People\u2019s Republic of China"],"affiliations":[{"raw_affiliation_string":"School of Electronic Engineering and Computer Science, Peking University, Beijing, 100871, People\u2019s Republic of China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054712771","display_name":"Weidong Li","orcid":"https://orcid.org/0000-0003-3094-4347"},"institutions":[{"id":"https://openalex.org/I195019228","display_name":"Yunnan Agricultural University","ror":"https://ror.org/04dpa3g90","country_code":"CN","type":"education","lineage":["https://openalex.org/I195019228"]},{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weidong Li","raw_affiliation_strings":["Dianchi College of Yunnan University, Kunming, 650000, People\u2019s Republic of China","School of Mathematics and Statistics, Yunnan University, Kunming, 650504, People\u2019s Republic of China"],"affiliations":[{"raw_affiliation_string":"Dianchi College of Yunnan University, Kunming, 650000, People\u2019s Republic of China","institution_ids":["https://openalex.org/I189210763","https://openalex.org/I195019228"]},{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, 650504, People\u2019s Republic of China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054712771"],"corresponding_institution_ids":["https://openalex.org/I189210763","https://openalex.org/I195019228"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4716,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82484284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"203","last_page":"211"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.994700014591217,"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/submodular-set-function","display_name":"Submodular set function","score":0.8694168329238892},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5938558578491211},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.589253842830658},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.495721697807312},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4940939247608185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4891844093799591},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4804055988788605},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.447751522064209},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4378727972507477},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.4164387583732605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.375964879989624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3542598485946655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10056141018867493}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8694168329238892},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5938558578491211},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.589253842830658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.495721697807312},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4940939247608185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4891844093799591},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4804055988788605},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.447751522064209},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4378727972507477},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4164387583732605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.375964879989624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3542598485946655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10056141018867493},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-27195-4_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-27195-4_19","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":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W571512295","https://openalex.org/W1551635709","https://openalex.org/W1572332593","https://openalex.org/W1576820654","https://openalex.org/W1964276725","https://openalex.org/W1965919218","https://openalex.org/W2011232221","https://openalex.org/W2019062750","https://openalex.org/W2044343300","https://openalex.org/W2062310236","https://openalex.org/W2088728264","https://openalex.org/W2128059732","https://openalex.org/W2137118456","https://openalex.org/W2138694041","https://openalex.org/W2152986618","https://openalex.org/W2338410001","https://openalex.org/W2554369515","https://openalex.org/W4299409673"],"related_works":["https://openalex.org/W2367244625","https://openalex.org/W2338410001","https://openalex.org/W175452553","https://openalex.org/W4312417404","https://openalex.org/W1608444752","https://openalex.org/W2950365512","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W3047700137"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}