{"id":"https://openalex.org/W4407310269","doi":"https://doi.org/10.48550/arxiv.2502.05059","title":"Exact Algorithms for Distance to Unique Vertex Cover","display_name":"Exact Algorithms for Distance to Unique Vertex Cover","publication_year":2025,"publication_date":"2025-02-07","ids":{"openalex":"https://openalex.org/W4407310269","doi":"https://doi.org/10.48550/arxiv.2502.05059"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2502.05059","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2502.05059","pdf_url":"https://arxiv.org/pdf/2502.05059","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2502.05059","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018558873","display_name":"Foivos Fioravantes","orcid":"https://orcid.org/0000-0001-8217-030X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fioravantes, Foivos","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Knop, Du\u0161an","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088003340","display_name":"Nikolaos Melissinos","orcid":"https://orcid.org/0000-0002-0864-9803"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Melissinos, Nikolaos","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006649123","display_name":"Michal Opler","orcid":"https://orcid.org/0000-0002-4389-5807"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Opler, Michal","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037706878","display_name":"Manolis Vasilakis","orcid":"https://orcid.org/0000-0001-6505-2977"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vasilakis, Manolis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5018558873"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9904999732971191,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9616000056266785,"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/cover","display_name":"Cover (algebra)","score":0.614707350730896},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5341927409172058},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5236454010009766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45605605840682983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4406171143054962},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2540411651134491},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1513902246952057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14550170302391052},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.13105499744415283}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.614707350730896},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5341927409172058},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5236454010009766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45605605840682983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4406171143054962},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2540411651134491},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1513902246952057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14550170302391052},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.13105499744415283},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2502.05059","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2502.05059","pdf_url":"https://arxiv.org/pdf/2502.05059","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2502.05059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2502.05059","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2502.05059","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2502.05059","pdf_url":"https://arxiv.org/pdf/2502.05059","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4407310269.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W1566660502","https://openalex.org/W2156896570","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433"],"abstract_inverted_index":{"Horiyama":[0,56],"et":[1,57],"al.":[2],"(AAAI":[3],"2024)":[4],"studied":[5],"the":[6,32,41,54,61,64,94,105,120,159,187,190,195],"problem":[7,121],"of":[8,31,63,96,107,131,161,189,194],"generating":[9],"graph":[10],"instances":[11],"that":[12,119,151,169],"possess":[13],"a":[14,46,87,97,102,138],"unique":[15,88],"minimum":[16,65,89],"vertex":[17,47,66,90,98],"cover":[18,67],"under":[19],"specific":[20],"conditions.":[21],"Their":[22],"approach":[23],"involved":[24],"pre-assigning":[25,45],"certain":[26],"vertices":[27],"to":[28,50,85,149],"be":[29],"part":[30,193],"solution":[33,191],"or":[34],"excluding":[35],"them":[36],"from":[37,53],"it.":[38],"Notably,":[39],"for":[40,128,142],"\\textsc{Vertex":[42],"Cover}":[43],"problem,":[44],"is":[48,84,122,145,153,171,180],"equivalent":[49],"removing":[51],"it":[52,179],"graph.":[55],"al.~focused":[58],"on":[59,104],"maintaining":[60],"size":[62,106,188],"after":[68],"these":[69],"modifications.":[70],"In":[71],"this":[72,80],"work,":[73],"we":[74,136,167,185],"extend":[75],"their":[76],"study":[77],"by":[78,158,176],"relaxing":[79],"constraint:":[81],"our":[82,111],"goal":[83],"ensure":[86],"cover,":[91],"even":[92,127],"if":[93,184],"removal":[95],"may":[99],"not":[100],"incur":[101],"decrease":[103],"said":[108],"cover.":[109],"Surprisingly,":[110],"relaxation":[112],"introduces":[113],"significant":[114],"theoretical":[115],"challenges.":[116],"We":[117],"observe":[118],"$\u03a3^2_P$-complete,":[123],"and":[124,163],"remains":[125],"so":[126],"planar":[129],"graphs":[130],"maximum":[132,164],"degree":[133],"5.":[134],"Nevertheless,":[135],"provide":[137],"linear":[139],"time":[140],"algorithm":[141],"trees,":[143],"which":[144],"then":[146],"further":[147],"leveraged":[148],"show":[150,168],"MU-VC":[152,170],"in":[154,172],"\\textsf{FPT}":[155],"when":[156,174],"parameterized":[157,175],"combination":[160],"treewidth":[162],"degree.":[165],"Finally,":[166],"\\textsf{XP}":[173],"clique-width":[177],"while":[178],"fixed-parameter":[181],"tractable":[182],"(FPT)":[183],"add":[186],"as":[192],"parameter.":[196]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}