{"id":"https://openalex.org/W4382404507","doi":"https://doi.org/10.1142/s0129054123500089","title":"Approximation Algorithms for Partial Vertex Covers in Trees","display_name":"Approximation Algorithms for Partial Vertex Covers in Trees","publication_year":2023,"publication_date":"2023-06-28","ids":{"openalex":"https://openalex.org/W4382404507","doi":"https://doi.org/10.1142/s0129054123500089"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054123500089","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054123500089","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/A5054627025","display_name":"Vahan Mkrtchyan","orcid":"https://orcid.org/0000-0002-2136-7835"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vahan Mkrtchyan","raw_affiliation_strings":["LDCSEE, West Virginia University, Morgantown, WV, USA\u2021"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LDCSEE, West Virginia University, Morgantown, WV, USA\u2021","institution_ids":["https://openalex.org/I12097938"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006200442","display_name":"Ojas Parekh","orcid":"https://orcid.org/0000-0003-2689-9264"},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ojas Parekh","raw_affiliation_strings":["Sandia National Laboratories\u00a7, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories\u00a7, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050337397","display_name":"K. Subramani","orcid":"https://orcid.org/0000-0001-5821-5117"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Subramani","raw_affiliation_strings":["LDCSEE, West Virginia University, Morgantown, WV, USA"],"raw_orcid":"https://orcid.org/0000-0001-5821-5117","affiliations":[{"raw_affiliation_string":"LDCSEE, West Virginia University, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054627025"],"corresponding_institution_ids":["https://openalex.org/I12097938"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63641795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"35","issue":"04","first_page":"387","last_page":"407"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9107000231742859,"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/T10142","display_name":"Formal Methods in Verification","score":0.9107000231742859,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9092000126838684,"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/vertex-cover","display_name":"Vertex cover","score":0.8459193110466003},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.7360389232635498},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6541194319725037},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6057416200637817},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5896097421646118},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5675233006477356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5608991384506226},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.42847999930381775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39554065465927124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3677231967449188},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3559703230857849}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8459193110466003},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.7360389232635498},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6541194319725037},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6057416200637817},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5896097421646118},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5675233006477356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5608991384506226},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.42847999930381775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39554065465927124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3677231967449188},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3559703230857849}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054123500089","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054123500089","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":[],"awards":[{"id":"https://openalex.org/G1198927059","display_name":null,"funder_award_id":"FA9550-19-1-0177","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1485007464","https://openalex.org/W1597777163","https://openalex.org/W1996896896","https://openalex.org/W2011039300","https://openalex.org/W2015706819","https://openalex.org/W2025760771","https://openalex.org/W2038225707","https://openalex.org/W2044726653","https://openalex.org/W2070814595","https://openalex.org/W2126448893","https://openalex.org/W2137118456","https://openalex.org/W2143698439","https://openalex.org/W2144407406","https://openalex.org/W2178856181","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W3029871987","https://openalex.org/W2079263399","https://openalex.org/W2906863651","https://openalex.org/W2043560626","https://openalex.org/W3016648842","https://openalex.org/W1986291375","https://openalex.org/W1689069845","https://openalex.org/W2030795846","https://openalex.org/W3122973673","https://openalex.org/W3003357078"],"abstract_inverted_index":{"This":[0],"paper":[1,175],"is":[2,56,114,176,276],"concerned":[3],"with":[4,160,165,258],"designing":[5],"algorithms":[6,210,234],"for":[7,211,266],"and":[8,132,163,194,225],"analyzing":[9],"the":[10,14,59,62,75,105,111,130,154,203,212,223,226,229,245,248,267],"computational":[11,155],"complexity":[12,156],"of":[13,104,122,137,157,173,186,228,232,247,273,282],"partial":[15,106,187],"vertex":[16,107,188],"cover":[17,108,189],"problem":[18,91,159],"in":[19,31,39,53,61,78,192,199,216,253,286,292],"trees.":[20],"Graphs":[21],"(and":[22],"trees)":[23],"are":[24,134,142,147,219,242,256],"frequently":[25],"used":[26,252],"to":[27,57,144,149,177,236,244,262,277],"model":[28,55],"risk":[29,60,67,80],"management":[30,81],"various":[32],"systems.":[33],"In":[34,95,202],"particular,":[35],"Caskurlu":[36],"et":[37],"al.":[38],"[4]":[40],"have":[41],"considered":[42],"a":[43,48,65,87,101,115,237,279],"system":[44,63,82],"which":[45,184,195,217,288],"essentially":[46],"represents":[47],"tripartite":[49],"graph.":[50],"The":[51,170,250],"goal":[52,77],"this":[54,79,96,123,158,174,254,274],"reduce":[58],"below":[64],"predefined":[66],"threshold":[68],"level.":[69],"It":[70],"can":[71,83,196],"be":[72,84,145,150,197,290],"shown":[73],"that":[74],"main":[76,171],"formulated":[85],"as":[86,295],"Partial":[88],"Vertex":[89],"Cover":[90],"on":[92,100,126,221],"bipartite":[93],"graphs.":[94],"paper,":[97,204],"we":[98,205],"focus":[99],"special":[102],"case":[103,215],"problem,":[109],"when":[110,240],"input":[112],"graph":[113],"tree.":[116,230,249],"We":[117],"consider":[118],"four":[119],"possible":[120],"versions":[121],"setting,":[124],"depending":[125],"whether":[127],"or":[128],"not,":[129],"vertices":[131,227],"edges":[133,141,224,246],"weighted.":[135],"Two":[136],"these":[138,179,233],"versions,":[139],"where":[140],"assumed":[143],"unweighted,":[146],"known":[148],"polynomial-time":[151,238],"solvable.":[152],"However,":[153],"weighted":[161,166],"edges,":[162],"possibly":[164],"vertices,":[167],"remained":[168],"open.":[169],"contribution":[172,272],"resolve":[178],"questions":[180],"by":[181],"fully":[182],"characterizing":[183],"variants":[185],"remain":[190],"NP-hard":[191],"trees,":[193,287],"solved":[198],"polynomial":[200],"time.":[201],"propose":[206,278],"two":[207],"pseudo-polynomial":[208],"DP-based":[209],"most":[213],"general":[214,268],"weights":[218,241],"present":[220],"both":[222],"One":[231],"leads":[235],"procedure,":[239],"confined":[243],"insights":[251],"algorithm":[255],"combined":[257],"additional":[259],"scaling":[260],"ideas":[261],"derive":[263],"an":[264],"FPTAS":[265],"case.":[269],"A":[270],"secondary":[271],"work":[275],"novel":[280],"way":[281],"using":[283],"centroid":[284],"decompositions":[285],"could":[289],"useful":[291],"other":[293],"settings":[294],"well.":[296]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}