{"id":"https://openalex.org/W4288388992","doi":"https://doi.org/10.1109/jcsse54890.2022.9836254","title":"An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem","display_name":"An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem","publication_year":2022,"publication_date":"2022-06-22","ids":{"openalex":"https://openalex.org/W4288388992","doi":"https://doi.org/10.1109/jcsse54890.2022.9836254"},"language":"en","primary_location":{"id":"doi:10.1109/jcsse54890.2022.9836254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcsse54890.2022.9836254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","raw_type":"proceedings-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/A5077502620","display_name":"Kunanon Burathep","orcid":null},"institutions":[{"id":"https://openalex.org/I198105771","display_name":"Kasetsart University","ror":"https://ror.org/05gzceg21","country_code":"TH","type":"education","lineage":["https://openalex.org/I198105771"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Kunanon Burathep","raw_affiliation_strings":["Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","Department of Computer Engineering, Kasetsart University, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","institution_ids":["https://openalex.org/I198105771"]},{"raw_affiliation_string":"Department of Computer Engineering, Kasetsart University, Bangkok, Thailand","institution_ids":["https://openalex.org/I198105771"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083727723","display_name":"Jittat Fakcharoenphol","orcid":"https://orcid.org/0000-0002-7859-8079"},"institutions":[{"id":"https://openalex.org/I198105771","display_name":"Kasetsart University","ror":"https://ror.org/05gzceg21","country_code":"TH","type":"education","lineage":["https://openalex.org/I198105771"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Jittat Fakcharoenphol","raw_affiliation_strings":["Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","Department of Computer Engineering, Kasetsart University, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Kasetsart University,Department of Computer Engineering,Bangkok,Thailand","institution_ids":["https://openalex.org/I198105771"]},{"raw_affiliation_string":"Department of Computer Engineering, Kasetsart University, Bangkok, Thailand","institution_ids":["https://openalex.org/I198105771"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077502620"],"corresponding_institution_ids":["https://openalex.org/I198105771"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10405191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6131747961044312},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5649689435958862},{"id":"https://openalex.org/keywords/tracking","display_name":"Tracking (education)","score":0.5435190200805664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5417957305908203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4175613820552826},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3228284418582916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.312568336725235},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19955679774284363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07043072581291199}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6131747961044312},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5649689435958862},{"id":"https://openalex.org/C2775936607","wikidata":"https://www.wikidata.org/wiki/Q466845","display_name":"Tracking (education)","level":2,"score":0.5435190200805664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5417957305908203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4175613820552826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3228284418582916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.312568336725235},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19955679774284363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07043072581291199},{"id":"https://openalex.org/C19417346","wikidata":"https://www.wikidata.org/wiki/Q7922","display_name":"Pedagogy","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jcsse54890.2022.9836254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcsse54890.2022.9836254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2019062750","https://openalex.org/W2024517697","https://openalex.org/W2039375254","https://openalex.org/W2044343300","https://openalex.org/W2120358419","https://openalex.org/W2150148016","https://openalex.org/W2161719898","https://openalex.org/W2955033360","https://openalex.org/W2990235631","https://openalex.org/W3042150117","https://openalex.org/W3191204702","https://openalex.org/W3198204543","https://openalex.org/W4210659411","https://openalex.org/W4247051268","https://openalex.org/W6766953442"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2084086966","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2023861399"],"abstract_inverted_index":{"This":[0,110],"paper":[1],"considers":[2],"two":[3],"problems":[4],"related":[5],"to":[6,12,30,55,74,143],"the":[7,22,32,47,62,97,124,138],"selection":[8],"of":[9,16,35,42,59],"weighted":[10],"vertices":[11,36],"cover":[13],"a":[14,57,93,105,116,119,154],"set":[15,34,58],"paths.":[17],"The":[18],"first":[19],"problem":[20,45,50,127],"is":[21,29,46],"Vertex":[23,99],"Multicut":[24,100],"on":[25,101,104],"Trees":[26,102],"whose":[27],"goal":[28],"find":[31],"cheapest":[33],"that":[37,65,147],"cut":[38],"every":[39,66],"given":[40],"pairs":[41],"vertices.":[43],"Another":[44],"Tracking":[48,125],"Paths":[49,126],"where":[51],"one":[52],"would":[53],"like":[54],"choose":[56],"\u201cbeacons\u201d":[60],"in":[61,118],"network":[63],"so":[64],"distinct":[67],"path":[68],"from":[69,141],"source":[70],"<tex":[71,76],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[72,77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$s$</tex>":[73],"target":[75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$t$</tex>":[78],"can":[79,112],"be":[80,113],"uniquely":[81],"identified":[82],"by":[83,128],"an":[84],"intersection":[85],"pattern":[86],"with":[87],"these":[88],"beacons.":[89],"Formally,":[90],"we":[91],"present":[92],"2-approximation":[94],"algorithm":[95,111,122],"for":[96,123],"Weighted":[98],"based":[103],"standard":[106],"randomized":[107],"rounding":[108],"procedure.":[109],"used":[114],"as":[115],"subroutine":[117],"recent":[120],"approximation":[121,139],"Bla\u017ee],":[129],"Choudhary,":[130],"Knop,":[131],"K\u0159i\u0161t'an,":[132],"Such\u00fd,":[133],"and":[134],"Valla":[135],"[WAOA'21],":[136],"improving":[137],"ratio":[140],"66":[142],"6.":[144],"We":[145],"note":[146],"Bla\u017eej":[148],"et.":[149],"al.":[150],"also":[151],"independently":[152],"obtained":[153],"similar":[155],"improvement.":[156]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}