{"id":"https://openalex.org/W7147259716","doi":"https://doi.org/10.48550/arxiv.2603.27795","title":"An Optimal Algorithm for Stochastic Vertex Cover","display_name":"An Optimal Algorithm for Stochastic Vertex Cover","publication_year":2026,"publication_date":"2026-03-29","ids":{"openalex":"https://openalex.org/W7147259716","doi":"https://doi.org/10.48550/arxiv.2603.27795"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.27795","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.27795","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.27795","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054956160","display_name":"Jan van den Brand","orcid":"https://orcid.org/0000-0001-8611-6896"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brand, Jan van den","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070148734","display_name":"Inge Li G\u00f8rtz","orcid":"https://orcid.org/0000-0002-8322-4952"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00f8rtz, Inge Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081649943","display_name":"Chirag Pabbaraju","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pabbaraju, Chirag","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132563418","display_name":"Debmalya Panigrahi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Panigrahi, Debmalya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stein, Clifford","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132555147","display_name":"Miltiadis Stouras","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stouras, Miltiadis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Svensson, Ola","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052582756","display_name":"Ali Vakilian","orcid":"https://orcid.org/0000-0001-5049-7594"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vakilian, Ali","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5054956160"],"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7721999883651733,"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.7721999883651733,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.07460000365972519,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.029600000008940697,"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/edge-cover","display_name":"Edge cover","score":0.7591999769210815},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7365999817848206},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5935999751091003},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5533999800682068},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48249998688697815},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.42879998683929443},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4214000105857849}],"concepts":[{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.7591999769210815},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7365999817848206},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.663100004196167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.650600016117096},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5935999751091003},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5533999800682068},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4603999853134155},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.42879998683929443},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4214000105857849},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.2915000021457672},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.28760001063346863},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25999999046325684},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.27795","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.27795","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":"doi:10.48550/arxiv.2603.27795","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.27795","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,42],"goal":[1],"in":[2,34,71,83,192],"the":[3,46,51,61,75,80,90,170,201],"stochastic":[4],"vertex":[5,14,101,205],"cover":[6,15,102,206],"problem":[7,183],"is":[8,21,44,65,145,195],"to":[9,60,97,109,147],"obtain":[10],"an":[11],"approximately":[12],"minimum":[13,204],"for":[16,94,118,176,181,200],"a":[17,35,99,121,132,196],"graph":[18,37,48,63],"$G^\\star$":[19,64],"that":[20,73],"realized":[22,62],"by":[23],"sampling":[24],"each":[25],"edge":[26,82,106],"independently":[27],"with":[28],"some":[29],"probability":[30,52],"$p\\in":[31],"(0,":[32],"1]$":[33],"base":[36,47],"$G":[38],"=":[39],"(V,":[40],"E)$.":[41],"algorithm":[43,180],"given":[45],"$G$":[49,72],"and":[50,128,131,140,155,186],"$p$":[53],"as":[54,158,160],"inputs,":[55],"but":[56],"its":[57],"only":[58,104],"access":[59],"through":[66],"queries":[67,125,137],"on":[68,207],"individual":[69],"edges":[70],"reveal":[74],"existence":[76],"(or":[77],"not)":[78],"of":[79,167,174,203,213],"queried":[81],"$G^\\star$.":[84],"In":[85],"this":[86,95,119,182],"paper,":[87],"we":[88],"resolve":[89],"central":[91],"open":[92],"question":[93],"problem:":[96,120],"find":[98],"$(1+\\varepsilon)$-approximate":[100],"using":[103,123,134],"$O_\\varepsilon(n/p)$":[105,124],"queries.":[107],"Prior":[108],"our":[110,193],"work,":[111],"there":[112],"were":[113],"two":[114],"incomparable":[115],"state-of-the-art":[116],"results":[117],"$(3/2+\\varepsilon)$-approximation":[122],"(Derakhshan,":[126,138],"Durvasula,":[127],"Haghtalab,":[129],"2023)":[130],"$(1+\\varepsilon)$-approximation":[133],"$O_\\varepsilon((n/p)\\cdot":[135],"\\mathrm{RS}(n))$":[136],"Saneian,":[139],"Xun,":[141],"2025),":[142],"where":[143],"$\\mathrm{RS}(n)$":[144],"known":[146,171],"be":[148,157,212],"at":[149],"least":[150],"$2^{\u03a9\\left(\\frac{\\log":[151],"n}{\\log":[152],"\\log":[153],"n}\\right)}$":[154],"could":[156],"large":[159],"$\\frac{n}{2^{\u0398(\\log^*":[161],"n)}}$.":[162],"Our":[163],"improved":[164],"upper":[165],"bound":[166,173,199],"$O_{\\varepsilon}(n/p)$":[168],"matches":[169],"lower":[172],"$\u03a9(n/p)$":[175],"any":[177],"constant-factor":[178],"approximation":[179],"(Behnezhad,":[184],"Blum,":[185],"Derakhshan,":[187],"2022).":[188],"A":[189],"key":[190],"tool":[191],"result":[194],"new":[197],"concentration":[198],"size":[202],"random":[208],"graphs,":[209],"which":[210],"might":[211],"independent":[214],"interest.":[215]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-04-02T00:00:00"}