{"id":"https://openalex.org/W3013750003","doi":"https://doi.org/10.1145/3357713.3384340","title":"Stochastic matching with few queries: (1-\u03b5) approximation","display_name":"Stochastic matching with few queries: (1-\u03b5) approximation","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3013750003","doi":"https://doi.org/10.1145/3357713.3384340","mag":"3013750003"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soheil Behnezhad","raw_affiliation_strings":["University of Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049873439","display_name":"Mahsa Derakhshan","orcid":"https://orcid.org/0000-0002-8147-0113"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahsa Derakhshan","raw_affiliation_strings":["University of Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["University of Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.1077,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.86807868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1111","last_page":"1124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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.9988999962806702,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7195497155189514},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6641466617584229},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.647494375705719},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5522213578224182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4760470390319824},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.45497891306877136},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.45420241355895996},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4384385943412781},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3843439817428589},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3647252023220062},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.2323472499847412},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07802581787109375}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7195497155189514},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6641466617584229},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.647494375705719},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5522213578224182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4760470390319824},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.45497891306877136},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.45420241355895996},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4384385943412781},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3843439817428589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3647252023220062},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2323472499847412},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07802581787109375},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2162740996","https://openalex.org/W2492999734","https://openalex.org/W2612033967"],"related_works":["https://openalex.org/W2399035783","https://openalex.org/W3161230432","https://openalex.org/W4367190712","https://openalex.org/W2134007003","https://openalex.org/W2019875157","https://openalex.org/W4310831616","https://openalex.org/W4301954754","https://openalex.org/W2951888513","https://openalex.org/W1489978714","https://openalex.org/W2782292024"],"abstract_inverted_index":{"Suppose":[0],"that":[1,12,44,55,126,153,168,177],"we":[2,118],"are":[3,178],"given":[4],"an":[5,151],"arbitrary":[6],"graph":[7],"G=(V,":[8],"E)":[9],"and":[10,97,124,141],"know":[11],"each":[13,169],"edge":[14],"in":[15,29,48,50],"E":[16],"is":[17,34,56,111,150,171],"going":[18],"to":[19,35,91,107,184],"be":[20],"realized":[21,46,66],"independently":[22,173],"with":[23],"some":[24,163],"probability":[25],"p.":[26],"The":[27,70],"goal":[28],"the":[30,45,61,65,82,95,98,175],"stochastic":[31,159],"matching":[32,54,63,156],"problem":[33,87],"pick":[36],"a":[37,53,112,120,130,155,158,186],"sparse":[38],"subgraph":[39],"Q":[40,74],"of":[41,68,73,84,142,147,197],"G":[42],"such":[43],"edges":[47,67],"Q,":[49],"expectation,":[51],"include":[52],"approximately":[57],"as":[58,60],"large":[59],"maximum":[62,71],"among":[64,162],"G.":[69,85],"degree":[72],"can":[75,128],"depend":[76],"on":[77,81,157,195],"p,":[78],"but":[79],"not":[80],"size":[83],"This":[86,181],"has":[88,101],"been":[89,102],"subject":[90],"extensive":[92],"studies":[93],"over":[94],"years":[96],"approximation":[99,193],"factor":[100],"improved":[103],"gradually":[104],"from":[105,174],"0.5":[106],"eventually":[108],"2/3":[109],"which":[110,161],"known":[113,188],"barrier.":[114],"In":[115],"this":[116],"work,":[117],"analyze":[119],"natural":[121],"sampling-based":[122],"algorithm":[123,152],"show":[125],"it":[127],"obtain":[129],"(1\u2212\u0454)":[131,192],"approximation,":[132],"for":[133],"any":[134],"constant":[135],"\u0454":[136],">":[137],"0.":[138],"A":[139],"key":[140],"possible":[143],"independent":[144],"interest":[145],"component":[146],"our":[148],"analysis":[149],"constructs":[154],"graph,":[160],"other":[164],"important":[165],"properties,":[166],"guarantees":[167],"vertex":[170],"matched":[172],"vertices":[176],"sufficiently":[179],"far.":[180],"allows":[182],"us":[183],"bypass":[185],"previously":[187],"barrier":[189],"towards":[190],"achieving":[191],"based":[194],"existence":[196],"dense":[198],"Ruzsa-Szemer\u00e9di":[199],"graphs.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}