{"id":"https://openalex.org/W4360614420","doi":"https://doi.org/10.1142/s0129054123460012","title":"The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings","display_name":"The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings","publication_year":2023,"publication_date":"2023-03-22","ids":{"openalex":"https://openalex.org/W4360614420","doi":"https://doi.org/10.1142/s0129054123460012"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054123460012","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054123460012","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/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":true,"raw_author_name":"Xiaofei Liu","raw_affiliation_strings":["School of Information Science and Engineering, Yunnan University, Kunming, P. R. China"],"raw_orcid":"https://orcid.org/0000-0002-1650-2625","affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yunnan University, Kunming, P. R. China","institution_ids":["https://openalex.org/I189210763"]}]},{"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/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":"Weidong Li","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, P. R. China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100373390"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.1968,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46251366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"36","issue":"05","first_page":"767","last_page":"780"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9429000020027161,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9429000020027161,"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.932200014591217,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.930400013923645,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6710724234580994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5319348573684692},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35702112317085266}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6710724234580994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5319348573684692},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35702112317085266}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054123460012","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054123460012","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4099999964237213}],"awards":[{"id":"https://openalex.org/G905374995","display_name":null,"funder_award_id":"12071417","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2017870028","https://openalex.org/W2018919524","https://openalex.org/W2019062750","https://openalex.org/W2044343300","https://openalex.org/W2067297441","https://openalex.org/W2088728264","https://openalex.org/W2132377873","https://openalex.org/W2137118456","https://openalex.org/W2138694041","https://openalex.org/W2164903952","https://openalex.org/W2175156623","https://openalex.org/W2175530190","https://openalex.org/W3015650256","https://openalex.org/W3042489864","https://openalex.org/W4313349784"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Given":[0],"a":[1,6,21,33,46,52,69,160],"graph":[2],"[Formula:":[3,9,14,17,24,29,35,42,48,54,58,71,89,103,118,124,134,144,149,154,171,176,193,198,211,216,223],"see":[4,10,15,18,25,30,36,43,49,55,59,64,72,90,104,119,125,135,145,150,155,172,177,194,199,212,217,224],"text],":[5,26,37,105],"set":[7],"of":[8,81,85,96,112,229,231],"text]":[11,16,19,31,44,50,73,91,120,151,173,195,213,225],"source-sink":[12,40],"pairs":[13,98,115],"and":[20,38,51,92,108,139,204],"profit":[22,47,111],"bound":[23],"every":[27,39],"edge":[28],"has":[32,45],"cost":[34,84],"pair":[41],"penalty":[53,95],"text].":[56,126,156],"The":[57],"text]-prize-collecting":[60],"multicut":[61,70],"problem":[62],"([Formula:":[63],"text]-PCMP)":[65],"is":[66,106,121,143,170,192,210,226],"to":[67],"find":[68],"such":[74],"that":[75,141],"the":[76,82,86,93,97,109,113,133,175,197,215,227],"objective":[77],"cost,":[78],"which":[79],"consists":[80],"total":[83,94,110],"edges":[87],"in":[88,137,179,201,219],"still":[99],"connected":[100],"after":[101],"removing":[102,117],"minimized":[107],"disconnected":[114],"by":[116],"at":[122],"least":[123],"In":[127],"this":[128,183],"paper,":[129],"we":[130,158,185],"firstly":[131],"consider":[132],"text]-PCMP":[136,178,200,218],"paths,":[138],"prove":[140],"it":[142],"text]-hard":[146],"even":[147],"when":[148],"for":[152,174,196,214],"any":[153],"Then,":[157],"present":[159,186],"fully":[161],"polynomial":[162],"time":[163,169,191,209],"approximation":[164],"scheme":[165],"(FPTAS)":[166],"whose":[167,189,207],"running":[168,190,208],"paths.":[180],"Based":[181],"on":[182],"algorithm,":[184],"an":[187,205],"FPTAS":[188,206],"spider":[202,232],"graphs,":[203],"rings,":[220],"respectively,":[221],"where":[222],"number":[228],"leaves":[230],"graph.":[233]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}