{"id":"https://openalex.org/W1984735486","doi":"https://doi.org/10.1137/0210050","title":"On a Greedy Heuristic for Complete Matching","display_name":"On a Greedy Heuristic for Complete Matching","publication_year":1981,"publication_date":"1981-11-01","ids":{"openalex":"https://openalex.org/W1984735486","doi":"https://doi.org/10.1137/0210050","mag":"1984735486"},"language":"en","primary_location":{"id":"doi:10.1137/0210050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210050","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5073186573","display_name":"Edward M. Reingold","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Edward M. Reingold","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801","$ Department of Computer Science, Stanford University, Stanford, California 94305"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"$ Department of Computer Science, Stanford University, Stanford, California 94305","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Bell Laboratories, 600 Mountain Avenue, Murray Hill, New Jersey 07974"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, 600 Mountain Avenue, Murray Hill, New Jersey 07974","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073186573"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":5.6697,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.95172414,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"4","first_page":"676","last_page":"681"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9957000017166138,"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.9947999715805054,"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/combinatorics","display_name":"Combinatorics","score":0.8265838623046875},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7214859127998352},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6907495856285095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6830849051475525},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6720113754272461},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.5917022824287415},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4707140326499939},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4504280686378479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4177098274230957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3415842354297638},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20589011907577515},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12225830554962158}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8265838623046875},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7214859127998352},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6907495856285095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6830849051475525},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6720113754272461},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.5917022824287415},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4707140326499939},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4504280686378479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4177098274230957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3415842354297638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20589011907577515},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12225830554962158},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0210050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210050","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.3920","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Epettie/matching/Reingold-Tarjan-greedy-metric-perfect-matching-approximation.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.75}],"awards":[{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W275997930","https://openalex.org/W289732966","https://openalex.org/W405334826","https://openalex.org/W1514415888","https://openalex.org/W2007610503","https://openalex.org/W2022179164","https://openalex.org/W2029360271","https://openalex.org/W2053913299","https://openalex.org/W2085558613","https://openalex.org/W2127470768","https://openalex.org/W2143037347","https://openalex.org/W2956015669","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843","https://openalex.org/W1965734368"],"abstract_inverted_index":{"Finding":[0],"a":[1,7,31,54,79,153],"minimum":[2,61,75],"weighted":[3,62,80],"complete":[4],"matching":[5,39,63,77,105,117],"on":[6,30],"set":[8],"of":[9,20,24,37,90,100,103,114,148],"vertices":[10,91],"in":[11,48,78],"which":[12,65],"the":[13,16,40,59,74,95,98,101,104,112,115],"distances":[14,93],"satisfy":[15,94],"triangle":[17,96],"inequality":[18],"is":[19,118],"general":[21,60],"interest":[22],"and":[23,131],"particular":[25],"importance":[26],"when":[27],"drawing":[28],"graphs":[29],"mechanical":[32],"plotter.":[33],"The":[34],"\u201cgreedy\u201d":[35],"heuristic":[36,110],"repeatedly":[38],"two":[41],"closest":[42],"unmatched":[43],"points":[44],"can":[45],"be":[46,152],"implemented":[47],"worst-case":[49],"time":[50,67],"$O(n^2":[51],"\\log":[52],"n)$,":[53],"reasonable":[55],"savings":[56],"compared":[57],"to":[58,69,72,111],"algorithm":[64],"requires":[66],"proportional":[68],"$n^3":[70],"$":[71],"find":[73],"cost":[76,102,113],"graph.":[81],"We":[82,139],"show":[83],"that,":[84],"for":[85,156],"an":[86],"even":[87],"number":[88],"n":[89],"whose":[92],"inequality,":[97],"ratio":[99],"produced":[106],"by":[107],"this":[108,137,142,157],"greedy":[109,143],"minimal":[116],"at":[119],"most":[120],"${}_3^4":[121],"n^{\\lg":[122],"_2^3":[123,128],"}":[124],"-":[125],"1$,":[126],"$\\lg":[127],"\\approx":[129],"0.58496$,":[130],"there":[132],"are":[133],"examples":[134],"that":[135,141],"achieve":[136],"bound.":[138],"conclude":[140],"heuristic,":[144],"although":[145],"desirable":[146],"because":[147],"its":[149],"simplicity,":[150],"would":[151],"poor":[154],"choice":[155],"problem.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}