{"id":"https://openalex.org/W1995337396","doi":"https://doi.org/10.1137/0219045","title":"Greedy Matching on the Line","display_name":"Greedy Matching on the Line","publication_year":1990,"publication_date":"1990-08-01","ids":{"openalex":"https://openalex.org/W1995337396","doi":"https://doi.org/10.1137/0219045","mag":"1995337396"},"language":"en","primary_location":{"id":"doi:10.1137/0219045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219045","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/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alan Frieze","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111437501","display_name":"Colin McDiarmid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Colin McDiarmid","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108103165","display_name":"Bruce Reed","orcid":"https://orcid.org/0009-0002-5656-8941"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bruce Reed","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056950019"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.995,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.73059543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"19","issue":"4","first_page":"666","last_page":"672"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8426870107650757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6807113885879517},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6673009395599365},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6623960733413696},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.532441258430481},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.43663448095321655},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4289144277572632},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3830481767654419},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2591794729232788},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22898536920547485},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07906728982925415},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07401031255722046}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8426870107650757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6807113885879517},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6673009395599365},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6623960733413696},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.532441258430481},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.43663448095321655},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4289144277572632},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3830481767654419},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2591794729232788},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22898536920547485},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07906728982925415},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07401031255722046}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0219045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219045","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.571.8675","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.571.8675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stats.ox.ac.uk/people/academic_staff/colin_mcdiarmid/?a=4180","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1969543582","https://openalex.org/W1984735486","https://openalex.org/W2160575093","https://openalex.org/W2322480514"],"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/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"The":[0,25],"problem":[1,30],"of":[2,7,66,84],"finding":[3],"a":[4,12],"perfect":[5,87],"matching":[6,68],"small":[8],"total":[9],"length":[10,65,83],"in":[11,19,60],"complete":[13],"graph":[14],"whose":[15],"vertices":[16],"are":[17,56],"points":[18,37,55],"the":[20,33,43,47,63,67,71,82,85],"interval":[21],"[0,1]":[22],"is":[23,50,74,90],"considered.":[24],"greedy":[26,72],"heuristic":[27],"for":[28],"this":[29],"repeatedly":[31],"picks":[32],"two":[34],"closest":[35],"unmatched":[36],"x":[38],"and":[39,41],"y,":[40],"adds":[42],"edge":[44],"$xy$":[45],"to":[46],"matching.":[48],"It":[49],"shown":[51],"that":[52],"if":[53],"$2n$":[54],"randomly":[57],"chosen":[58],"uniformly":[59],"$[0,1]$,":[61],"then":[62],"expected":[64],"given":[69],"by":[70],"algorithm":[73],"$\\theta":[75],"(\\log":[76],"n)$.":[77],"This":[78],"compares":[79],"unfavourably":[80],"with":[81],"shortest":[86],"matching,":[88],"which":[89],"always":[91],"less":[92],"than":[93],"1.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}