{"id":"https://openalex.org/W4394883988","doi":"https://doi.org/10.1017/s0960129524000124","title":"An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties","display_name":"An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties","publication_year":2024,"publication_date":"2024-03-01","ids":{"openalex":"https://openalex.org/W4394883988","doi":"https://doi.org/10.1017/s0960129524000124"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129524000124","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129524000124","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in 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/A5100373390","display_name":"Xiaofei Liu","orcid":"https://orcid.org/0000-0002-1650-2625"},"institutions":[{"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":false,"raw_author_name":"Xiaofei Liu","raw_affiliation_strings":["School of Information Science and Engineering, Yunnan University, Kunming, 650500, China"],"raw_orcid":"https://orcid.org/0000-0002-1650-2625","affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University, Kunming, 650500, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100710867","display_name":"Weidong Li","orcid":"https://orcid.org/0000-0001-5559-7834"},"institutions":[{"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":["School of Mathematics and Statistics, Yunnan University, Kunming, 650500, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, 650500, China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100710867"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":2.8822,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91481,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"34","issue":"3","first_page":"193","last_page":"210"},"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.9991000294685364,"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.9991000294685364,"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.9926999807357788,"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/T11182","display_name":"Auction Theory and Applications","score":0.9807999730110168,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.870423436164856},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7865384817123413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7464865446090698},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42300477623939514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39215609431266785},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06349638104438782}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.870423436164856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7865384817123413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7464865446090698},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42300477623939514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39215609431266785},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06349638104438782}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0960129524000124","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129524000124","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1500938493","https://openalex.org/W1576820654","https://openalex.org/W2011193572","https://openalex.org/W2019062750","https://openalex.org/W2044343300","https://openalex.org/W2050285203","https://openalex.org/W2050511894","https://openalex.org/W2062310236","https://openalex.org/W2088728264","https://openalex.org/W2137118456","https://openalex.org/W2138694041","https://openalex.org/W2150815458","https://openalex.org/W2152986618","https://openalex.org/W2161719898","https://openalex.org/W2175530190","https://openalex.org/W2197046994","https://openalex.org/W2338410001","https://openalex.org/W2739491435","https://openalex.org/W2982337331","https://openalex.org/W2995983675","https://openalex.org/W3015650256","https://openalex.org/W3042489864","https://openalex.org/W3193829882","https://openalex.org/W3194671897","https://openalex.org/W3200611036","https://openalex.org/W4225489905","https://openalex.org/W4247051268","https://openalex.org/W4307156230","https://openalex.org/W4360614420","https://openalex.org/W6800266339","https://openalex.org/W6851071854"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W4313349366","https://openalex.org/W3141561286","https://openalex.org/W4288560659"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"$T=(V,E)$":[2],"be":[3,16],"a":[4,12,17,32,35,55,104,115],"tree":[5],"in":[6,24,26,47,85,183],"which":[7,27],"each":[8,28],"edge":[9],"is":[10,52,74,96,101,138,143,153,172],"assigned":[11],"cost;":[13],"let":[14],"$\\mathcal{P}$":[15],"set":[18,92],"of":[19,22,65,83,90,93,134,147,164,179],"source\u2013sink":[20,29],"pairs":[21,68,95],"vertices":[23],"V":[25],"pair":[30],"produces":[31],"profit.":[33],"Given":[34],"lower":[36],"bound":[37],"K":[38,43,77],"for":[39],"the":[40,42,62,66,80,88,91,99,110,122,125,131,135,144,148,161,165,169,180],"profit,":[41],"-prize-collecting":[44],"multicut":[45,57],"problem":[46],"trees":[48],"with":[49,177],"submodular":[50,106,149],"penalties":[51],"to":[53],"determine":[54],"partial":[56],"$M\\subseteq":[58],"E$":[59],"such":[60],"that":[61,130,160,178],"total":[63,81,145],"profit":[64],"disconnected":[67],"after":[69],"removing":[70],"M":[71,86],"from":[72],"T":[73],"at":[75],"least":[76],",":[78,140],"and":[79,151],"cost":[82],"edges":[84],"plus":[87],"penalty":[89,100],"still-connected":[94],"minimized,":[97],"where":[98,141],"determined":[102],"by":[103,119,168],"nondecreasing":[105],"function.":[107],"Based":[108],"on":[109],"primal-dual":[111],"scheme,":[112],"we":[113,128],"present":[114],"combinatorial":[116],"polynomial-time":[117],"algorithm":[118,137,171],"carefully":[120],"increasing":[121],"penalty.":[123],"In":[124],"theoretical":[126],"analysis,":[127],"prove":[129],"approximation":[132],"factor":[133],"proposed":[136,170],"$(\\frac{8}{3}+\\frac{4}{3}\\kappa+\\varepsilon)$":[139],"$\\kappa$":[142],"curvature":[146],"function":[150],"$\\varepsilon$":[152],"any":[154],"fixed":[155],"positive":[156],"number.":[157],"Experiments":[158],"reveal":[159],"objective":[162],"value":[163,182],"solutions":[166],"generated":[167],"less":[173],"than":[174],"130%":[175],"compared":[176],"optimal":[181],"most":[184],"cases.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}