{"id":"https://openalex.org/W1539682630","doi":"https://doi.org/10.1145/1536414.1536447","title":"An improved constant-time approximation algorithm for maximum~matchings","display_name":"An improved constant-time approximation algorithm for maximum~matchings","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W1539682630","doi":"https://doi.org/10.1145/1536414.1536447","mag":"1539682630"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536447","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM 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/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["Kyoto University, Kyoto, Japan","Kyoto University, Kyoto, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Kyoto University, Kyoto, Japan#TAB#","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072326450","display_name":"Masaki Yamamoto","orcid":"https://orcid.org/0000-0002-0288-7990"},"institutions":[{"id":"https://openalex.org/I1314466530","display_name":"Tokai University","ror":"https://ror.org/01p7qe739","country_code":"JP","type":"education","lineage":["https://openalex.org/I1314466530"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masaki Yamamoto","raw_affiliation_strings":["Tokai University, Hiratsuka, Japan","Tokai University, Hiratsuka , Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokai University, Hiratsuka, Japan","institution_ids":["https://openalex.org/I1314466530"]},{"raw_affiliation_string":"Tokai University, Hiratsuka , Japan","institution_ids":["https://openalex.org/I1314466530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031213478","display_name":"Hiro Ito","orcid":"https://orcid.org/0000-0001-6975-0422"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiro Ito","raw_affiliation_strings":["Kyoto University, Kyoto, Japan","Kyoto University, Kyoto, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Kyoto University, Kyoto, Japan#TAB#","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.9983000159263611,"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/vertex-cover","display_name":"Vertex cover","score":0.785353422164917},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7555457353591919},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6650981307029724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6144710183143616},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5817804336547852},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5765663981437683},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.5735039114952087},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.570264458656311},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5409167408943176},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.5338994264602661},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4903571605682373},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.46777763962745667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46121513843536377},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4432607889175415},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4417802691459656},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4317699670791626},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4183316230773926},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3917694687843323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.230977863073349},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20688015222549438}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.785353422164917},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7555457353591919},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6650981307029724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6144710183143616},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5817804336547852},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5765663981437683},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.5735039114952087},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.570264458656311},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5409167408943176},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.5338994264602661},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4903571605682373},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.46777763962745667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46121513843536377},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4432607889175415},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4417802691459656},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4317699670791626},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4183316230773926},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3917694687843323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.230977863073349},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20688015222549438},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1536414.1536447","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM 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":17,"referenced_works":["https://openalex.org/W1515679427","https://openalex.org/W1525849820","https://openalex.org/W1601764037","https://openalex.org/W1606712848","https://openalex.org/W1970411956","https://openalex.org/W1970630090","https://openalex.org/W1980155175","https://openalex.org/W2001907516","https://openalex.org/W2011039300","https://openalex.org/W2018925011","https://openalex.org/W2056168287","https://openalex.org/W2066717841","https://openalex.org/W2109330224","https://openalex.org/W2110009764","https://openalex.org/W2163322487","https://openalex.org/W2242669280","https://openalex.org/W6630799893"],"related_works":["https://openalex.org/W2359923140","https://openalex.org/W1994773828","https://openalex.org/W1966805076","https://openalex.org/W2778284341","https://openalex.org/W2012700732","https://openalex.org/W1983330102","https://openalex.org/W2579422054","https://openalex.org/W3102280101","https://openalex.org/W3150189735","https://openalex.org/W2037935057"],"abstract_inverted_index":{"This":[0,24],"paper":[1,25],"studies":[2],"approximation":[3,57,93],"algorithms":[4,58,85],"for":[5,59,95,107,129],"problems":[6],"on":[7],"degree-bounded":[8],"graphs.":[9],"Let":[10],"n":[11,42],"and":[12,19,73,90],"d":[13,89],"be":[14,101],"the":[15,20,31,64,68,74,96,108,119,130],"number":[16],"of":[17,33,110],"vertices":[18],"degree":[21],"bound,":[22],"respectively.":[23],"presents":[26],"an":[27],"algorithm":[28,94,106],"to":[29,88,103],"approximate":[30],"size":[32],"some":[34],"maximal":[35],"independent":[36],"set":[37,76],"with":[38,86,115],"additive":[39],"error":[40,127],"\u03b5":[41],"whose":[43],"running":[44],"time":[45],"is":[46],"O(d2).":[47],"Using":[48],"this":[49],"algorithm,":[50],"it":[51,121],"also":[52,122],"shows":[53,123],"that":[54,79,124],"there":[55],"are":[56],"many":[60],"other":[61],"problems,":[62],"e.g.,":[63],"maximum":[65,97],"matching":[66,98,114],"problem,":[67,72,78],"minimum":[69,75],"vertex":[70],"cover":[71,77],"run":[80],"exponentially":[81],"faster":[82],"than":[83],"existing":[84],"respect":[87],"1/\u03b5.":[91],"Its":[92],"problem":[99],"can":[100],"transformed":[102],"a":[104,112],"testing":[105],"property":[109,131],"having":[111],"perfect":[113],"two-sided":[116],"error.":[117],"On":[118],"contrary,":[120],"every":[125],"one-sided":[126],"tester":[128],"requires":[132],"at":[133],"least":[134],"\u03a9(n)":[135],"queries.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":9}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}