{"id":"https://openalex.org/W1970411956","doi":"https://doi.org/10.1002/rsa.3240020104","title":"Randomized greedy matching","display_name":"Randomized greedy matching","publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W1970411956","doi":"https://doi.org/10.1002/rsa.3240020104","mag":"1970411956"},"language":"en","primary_location":{"id":"doi:10.1002/rsa.3240020104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240020104","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","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/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Martin Dyer","raw_affiliation_strings":["School of Computer Studies, University of Leeds, Leeds, United Kingdom","School of Computer Studies, University of Leeds, Leeds, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Studies, University of Leeds, Leeds, United Kingdom","institution_ids":["https://openalex.org/I130828816"]},{"raw_affiliation_string":"School of Computer Studies, University of Leeds, Leeds, United Kingdom#TAB#","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":["Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA 15213-389C"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA 15213-389C","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019297501"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":2.0526,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.85150519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"29","last_page":"45"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9991999864578247,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.6640064716339111},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6566715836524963},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6342119574546814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6310975551605225},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5967299342155457},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46596458554267883},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4600818455219269},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4479769468307495},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.4208469092845917},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3729132413864136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3448346257209778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3026335835456848},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12561529874801636},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08911067247390747}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6640064716339111},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6566715836524963},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6342119574546814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6310975551605225},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5967299342155457},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46596458554267883},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4600818455219269},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4479769468307495},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.4208469092845917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3729132413864136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3448346257209778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3026335835456848},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12561529874801636},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08911067247390747},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/rsa.3240020104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rsa.3240020104","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures & Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:repository.cmu.edu:math-1430","is_oa":false,"landing_page_url":"http://repository.cmu.edu/math/431","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Mathematical Sciences","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6479273","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal contribution"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.7099999785423279,"display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G6885142738","display_name":null,"funder_award_id":"RG0088/89","funder_id":"https://openalex.org/F4320307849","funder_display_name":"North Atlantic Treaty Organization"}],"funders":[{"id":"https://openalex.org/F4320307849","display_name":"North Atlantic Treaty Organization","ror":"https://ror.org/05xagc088"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1599161138","https://openalex.org/W2989661724"],"related_works":["https://openalex.org/W2277088917","https://openalex.org/W4280543056","https://openalex.org/W2154172459","https://openalex.org/W2541760731","https://openalex.org/W2018096104","https://openalex.org/W1827895227","https://openalex.org/W2373750984","https://openalex.org/W45904909","https://openalex.org/W2163115662","https://openalex.org/W4382935776"],"abstract_inverted_index":{"Abstract":[0],"We":[1,18,31,44,105],"consider":[2],"a":[3,12,16,60],"randomized":[4],"version":[5],"of":[6,35,75,81],"the":[7,21,33,39,73,76,92,98,108],"greedy":[8],"algorithm":[9,37],"for":[10,50],"finding":[11],"large":[13],"matching":[14,61],"in":[15,63],"graph.":[17],"assume":[19],"that":[20,46,66,91,107,118],"next":[22],"edge":[23],"is":[24,42,113,121],"always":[25],"randomly":[26],"chosen":[27],"from":[28],"those":[29],"remaining.":[30],"analyze":[32],"performance":[34],"this":[36,52,119],"when":[38],"input":[40],"graph":[41],"fixed.":[43],"show":[45,90],"there":[47],"are":[48],"graphs":[49,83,86],"which":[51],"Randomized":[53],"Greedy":[54],"Algorithm":[55],"(RGA)":[56],"usually":[57],"only":[58],"obtains":[59],"close":[62],"size":[64,74],"to":[65,110],"guaranteed":[67],"by":[68],"worst\u2010case":[69],"analysis":[70],"(i.e.,":[71],"half":[72],"maximum).":[77],"For":[78],"some":[79],"classes":[80],"sparse":[82],"(e.g.,":[84],"planar":[85],"and":[87,117],"forests)":[88],"we":[89],"RGA":[93],"performs":[94],"significantly":[95],"better":[96],"than":[97],"worst\u2010case.":[99],"Our":[100],"main":[101],"theorem":[102],"concerns":[103],"forests.":[104],"prove":[106],"ratio":[109],"maximum":[111],"here":[112],"at":[114],"least":[115],"0.7690\u2026,":[116],"bound":[120],"tight.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}