{"id":"https://openalex.org/W4376639639","doi":"https://doi.org/10.1145/3564246.3585230","title":"Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation","display_name":"Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639639","doi":"https://doi.org/10.1145/3564246.3585230"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585230","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","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/A5049873439","display_name":"Mahsa Derakhshan","orcid":"https://orcid.org/0000-0002-8147-0113"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mahsa Derakhshan","raw_affiliation_strings":["Northeastern University, USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069850886","display_name":"Naveen Durvasula","orcid":"https://orcid.org/0009-0006-3253-5335"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Naveen Durvasula","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080772091","display_name":"Nika Haghtalab","orcid":"https://orcid.org/0000-0002-8612-2089"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nika Haghtalab","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049873439"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1064317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"242","last_page":"253"},"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.9994999766349792,"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.9994999766349792,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9961000084877014,"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.8938366174697876},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8673678636550903},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7035815119743347},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6772758364677429},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5978238582611084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.512712836265564},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4676726758480072},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4659017026424408},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4579947590827942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3028143644332886},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07775625586509705}],"concepts":[{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.8938366174697876},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8673678636550903},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7035815119743347},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6772758364677429},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5978238582611084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.512712836265564},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4676726758480072},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4659017026424408},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4579947590827942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3028143644332886},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07775625586509705},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585230","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2649554787","display_name":"CAREER: Towards a theory of machine learning with strategic interactions","funder_award_id":"2145898","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4584308787","display_name":null,"funder_award_id":"CCF-2145898","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320319788","display_name":"C3.ai Digital Transformation Institute","ror":null},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1966387432","https://openalex.org/W2006618115","https://openalex.org/W2122109562","https://openalex.org/W2492999734","https://openalex.org/W2612033967","https://openalex.org/W2899907314","https://openalex.org/W2962958397","https://openalex.org/W2963562941","https://openalex.org/W2964336535","https://openalex.org/W2973231073","https://openalex.org/W2998210727","https://openalex.org/W3013750003","https://openalex.org/W3128811385","https://openalex.org/W4205999860","https://openalex.org/W4248588986","https://openalex.org/W4252630569","https://openalex.org/W4256214929","https://openalex.org/W4299842315"],"related_works":["https://openalex.org/W41549461","https://openalex.org/W2116388786","https://openalex.org/W2892107877","https://openalex.org/W2374778222","https://openalex.org/W2088441650","https://openalex.org/W2998559656","https://openalex.org/W4294702976","https://openalex.org/W2181572306","https://openalex.org/W1996499572","https://openalex.org/W4213152370"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2],"stochastic":[3],"vertex":[4,58],"cover":[5,59],"problem.":[6],"In":[7],"this":[8,51],"problem,":[9],"G":[10,27],"=":[11],"(V,":[12],"E)":[13],"is":[14,21,32,53],"an":[15,22],"arbitrary":[16],"known":[17],"graph,":[18],"and":[19],"G\u22c6":[20,40,61],"unknown":[23],"random":[24],"subgraph":[25],"of":[26,39,60,66],"where":[28],"each":[29],"edge":[30,46],"e":[31],"realized":[33],"independently":[34],"with":[35],"probability":[36],"p.":[37],"Edges":[38],"can":[41],"only":[42],"be":[43],"verified":[44],"using":[45,62],"queries.":[47,67],"The":[48],"goal":[49],"in":[50],"problem":[52],"to":[54],"find":[55],"a":[56,63],"minimum":[57],"small":[64],"number":[65]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
