{"id":"https://openalex.org/W7165688817","doi":"https://doi.org/10.48550/arxiv.2606.22831","title":"Learning-Augmented Algorithms for Online Vertex Cover","display_name":"Learning-Augmented Algorithms for Online Vertex Cover","publication_year":2026,"publication_date":"2026-06-22","ids":{"openalex":"https://openalex.org/W7165688817","doi":"https://doi.org/10.48550/arxiv.2606.22831"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.22831","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22831","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.22831","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036480021","display_name":"Tianhang Lu","orcid":"https://orcid.org/0009-0001-8137-8149"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu, Tianhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047511868","display_name":"Runtian Ren","orcid":"https://orcid.org/0000-0002-8640-0421"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ren, Runtian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103870133","display_name":"Liu S","orcid":"https://orcid.org/0000-0001-7255-0982"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Shengcai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.29899999499320984,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.29899999499320984,"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/T12288","display_name":"Optimization and Search Problems","score":0.2646999955177307,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.09690000116825104,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8216000199317932},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6973999738693237},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.515500009059906},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4880000054836273},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4244000017642975},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4097000062465668},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.40450000762939453},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3783000111579895}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8216000199317932},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6973999738693237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5609999895095825},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.515500009059906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5062000155448914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4880000054836273},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4244000017642975},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41100001335144043},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3828999996185303},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3799000084400177},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.37540000677108765},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3416000008583069},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3391999900341034},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.31709998846054077},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.29660001397132874},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.2816999852657318},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.26420000195503235},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.251800000667572},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.25110000371932983},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.22831","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22831","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.22831","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.22831","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4927580654621124,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"learning-augmented":[3,53],"online":[4,31],"weighted":[5],"vertex":[6,37],"cover":[7,38],"with":[8],"local":[9],"advice":[10],"and":[11,24,69,84,107],"a":[12,35,63,78],"tradeoff":[13],"parameter":[14],"$\u03bb\\in":[15],"(0,1)$.":[16],"We":[17,42,86,97],"consider":[18],"two":[19],"graph":[20,59,74],"settings:":[21],"bipartite":[22,58],"graphs":[23],"general":[25,73],"graphs.":[26],"In":[27],"both":[28,95],"settings,":[29],"the":[30,48,57,72,89,100],"algorithm":[32,65,80],"must":[33],"maintain":[34],"feasible":[36],"under":[39],"irrevocable":[40],"decisions.":[41],"show":[43],"that":[44,66,81,88],"these":[45],"problems":[46],"admit":[47],"same":[49],"robustness--consistency":[50],"tradeoffs":[51,90],"as":[52],"ski":[54],"rental.":[55],"For":[56,71],"model,":[60,75],"we":[61,76],"give":[62,77],"randomized":[64],"is":[67,82],"$\\frac{1}{1-e^{-\u03bb}}$-robust":[68],"$\\frac\u03bb{1-e^{-\u03bb}}$-consistent.":[70],"deterministic":[79],"$(1+\\frac{1}\u03bb)$-robust":[83],"$(1+\u03bb)$-consistent.":[85],"prove":[87],"above":[91],"are":[92],"optimal":[93],"in":[94],"settings.":[96],"also":[98],"validate":[99],"proposed":[101],"algorithms":[102],"through":[103],"experiments":[104],"on":[105],"synthetic":[106],"real-world":[108],"datasets.":[109]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2026-06-24T00:00:00"}