{"id":"https://openalex.org/W2275325805","doi":"https://doi.org/10.1145/2786753","title":"Improved Distributed Approximate Matching","display_name":"Improved Distributed Approximate Matching","publication_year":2015,"publication_date":"2015-11-02","ids":{"openalex":"https://openalex.org/W2275325805","doi":"https://doi.org/10.1145/2786753","mag":"2275325805"},"language":"en","primary_location":{"id":"doi:10.1145/2786753","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2786753","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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/A5016606156","display_name":"Zvi Lotker","orcid":"https://orcid.org/0000-0002-3759-5584"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Zvi Lotker","raw_affiliation_strings":["Ben Gurion University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben Gurion University","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016261142","display_name":"Boaz Patt-Shamir","orcid":"https://orcid.org/0000-0001-8398-8218"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Boaz Patt-Shamir","raw_affiliation_strings":["Tel Aviv University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016606156"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":5.4507,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.96278149,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"62","issue":"5","first_page":"1","last_page":"17"},"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.9998000264167786,"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.9998000264167786,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965999722480774,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9930999875068665,"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/binary-logarithm","display_name":"Binary logarithm","score":0.7655413150787354},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7315343618392944},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6810731887817383},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6653133034706116},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5695363283157349},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5670075416564941},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5645163059234619},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5140138864517212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45560353994369507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4369274973869324},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.43682661652565},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4228472113609314},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4224967360496521},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39698031544685364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3740403652191162},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.157362699508667},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.06809031963348389}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7655413150787354},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7315343618392944},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6810731887817383},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6653133034706116},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5695363283157349},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5670075416564941},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5645163059234619},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5140138864517212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45560353994369507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4369274973869324},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.43682661652565},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4228472113609314},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4224967360496521},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39698031544685364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3740403652191162},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.157362699508667},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.06809031963348389},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2786753","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2786753","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1494735819","https://openalex.org/W1523785148","https://openalex.org/W1558472444","https://openalex.org/W1563315847","https://openalex.org/W1595681210","https://openalex.org/W1791617053","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1970155114","https://openalex.org/W1975146994","https://openalex.org/W1980155175","https://openalex.org/W1993913882","https://openalex.org/W1998137177","https://openalex.org/W1998375300","https://openalex.org/W2014533003","https://openalex.org/W2030863680","https://openalex.org/W2039562302","https://openalex.org/W2044578110","https://openalex.org/W2047281923","https://openalex.org/W2054910423","https://openalex.org/W2074629498","https://openalex.org/W2083410501","https://openalex.org/W2092534058","https://openalex.org/W2100061495","https://openalex.org/W2106387257","https://openalex.org/W2111366547","https://openalex.org/W2117761060","https://openalex.org/W2126169247","https://openalex.org/W2156678048","https://openalex.org/W2157529519","https://openalex.org/W2161176300","https://openalex.org/W2166645359","https://openalex.org/W2395227458","https://openalex.org/W2569130577","https://openalex.org/W2949195414","https://openalex.org/W2952376370","https://openalex.org/W2952664231","https://openalex.org/W2953271509","https://openalex.org/W4205300528","https://openalex.org/W4302338090"],"related_works":["https://openalex.org/W2036758175","https://openalex.org/W2123112061","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W2899261484","https://openalex.org/W2137594557","https://openalex.org/W2407321536","https://openalex.org/W4299725383","https://openalex.org/W2902010279","https://openalex.org/W2952147765"],"abstract_inverted_index":{"We":[0],"present":[1,93],"distributed":[2],"network":[3,23],"algorithms":[4,116,136],"to":[5],"compute":[6],"weighted":[7,90],"and":[8,15,67,84,147],"unweighted":[9,36],"matchings":[10],"with":[11,144],"improved":[12],"approximation":[13,99],"ratios":[14],"running":[16,151],"times.":[17],"The":[18,70],"computational":[19],"model":[20],"is":[21],"a":[22],"of":[24,65,73],"processors":[25],"exchanging":[26],"O":[27,45,60,104,121,129],"(log":[28,46,122],"n":[29,47,62,108,123,131],")-bit":[30],"messages":[31],"(the":[32],"CONGEST":[33],"model).":[34],"For":[35,89],"graphs,":[37,91],"we":[38,92],"give":[39],"an":[40],"algorithm":[41,75,95],"providing":[42],"(1-\u03f5)-approximation":[43],"in":[44,59,80,86,100,103,120,128],")":[48,63,109,124,132],"time":[49,64,71,125],"for":[50,148],"any":[51],"constant":[52],"\u03f5>0,":[53],"improving":[54,111],"on":[55,77,112],"the":[56,74,81,113,139,149],"classical":[57],"\u00bd-approximation":[58,127],"log":[61,107],"Israeli":[66],"Itai":[68],"[1986].":[69],"complexity":[72,140],"depends":[76],"1\u2043\u03f5":[78],"exponentially":[79],"general":[82,101],"case,":[83],"polynomially":[85],"bipartite":[87],"graphs.":[88],"another":[94],"which":[96,117],"provides":[97],"(\u00bd-\u03f5)":[98],"graphs":[102],"(log\u03f5":[105],"-1":[106],"time,":[110],"previously":[114],"known":[115],"attain":[118],"(\u00bc-\u03f5)-approximation":[119],"or":[126],"(":[130],"time.":[133,152],"All":[134],"our":[135],"are":[137],"randomized:":[138],"bounds":[141],"hold":[142],"both":[143],"high":[145],"probability":[146],"expected":[150]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}