{"id":"https://openalex.org/W2072015757","doi":"https://doi.org/10.1137/110828691","title":"Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems","display_name":"Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2072015757","doi":"https://doi.org/10.1137/110828691","mag":"2072015757"},"language":"en","primary_location":{"id":"doi:10.1137/110828691","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110828691","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/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072326450","display_name":"Masaki Yamamoto","orcid":"https://orcid.org/0000-0002-0288-7990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Masaki Yamamoto","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031213478","display_name":"Hiro Ito","orcid":"https://orcid.org/0000-0001-6975-0422"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hiro Ito","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038701345"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0325,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.91625723,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"41","issue":"4","first_page":"1074","last_page":"1093"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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.9973999857902527,"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/vertex-cover","display_name":"Vertex cover","score":0.777362585067749},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7220646739006042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7129708528518677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6282356977462769},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6003803014755249},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5755297541618347},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5515354871749878},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5481734871864319},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5120392441749573},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5116520524024963},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.5018541812896729},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.4938848614692688},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4700450003147125},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4399207532405853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4321558475494385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42913123965263367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1786157488822937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13197258114814758}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.777362585067749},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7220646739006042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7129708528518677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6282356977462769},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6003803014755249},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5755297541618347},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5515354871749878},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5481734871864319},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5120392441749573},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5116520524024963},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.5018541812896729},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.4938848614692688},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4700450003147125},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4399207532405853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4321558475494385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42913123965263367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1786157488822937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13197258114814758},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110828691","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110828691","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1527654424","https://openalex.org/W1970411956","https://openalex.org/W1970630090","https://openalex.org/W1980155175","https://openalex.org/W1980816908","https://openalex.org/W2018925011","https://openalex.org/W2066717841","https://openalex.org/W2081449822","https://openalex.org/W2110009764","https://openalex.org/W2163322487","https://openalex.org/W3023402925"],"related_works":["https://openalex.org/W1712180277","https://openalex.org/W2056597184","https://openalex.org/W2359923140","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2096382750","https://openalex.org/W3184115741","https://openalex.org/W1539682630","https://openalex.org/W2072015757"],"abstract_inverted_index":{"We":[0,19],"study":[1],"constant-time":[2,53],"approximation":[3,54,99],"algorithms":[4,55,91],"for":[5,65,101,114,132],"bounded-degree":[6],"graphs,":[7],"which":[8],"run":[9,86],"in":[10,30],"time":[11],"independent":[12,35],"of":[13,16,117],"the":[14,45,70,74,80,102,115,123,133],"number":[15],"vertices":[17],"$n$.":[18],"present":[20],"an":[21],"algorithm":[22,100],"that":[23,85,127],"decides":[24],"whether":[25],"a":[26,31,110,119],"vertex":[27,76],"is":[28,44],"contained":[29],"some":[32],"fixed":[33],"maximal":[34],"set":[36,82],"with":[37,56,92],"expected":[38],"query":[39],"complexity":[40],"$O(d^2)$,":[41],"where":[42],"$d$":[43,95],"degree":[46],"bound.":[47],"Using":[48],"this":[49],"algorithm,":[50],"we":[51,125],"show":[52,126],"certain":[57],"multiplicative":[58],"error":[59,62,112,130],"and":[60,79,96],"additive":[61],"$\\epsilon":[63],"n$":[64],"many":[66],"other":[67],"problems,":[68],"e.g.,":[69],"maximum":[71,103],"matching":[72,104],"problem,":[73,78,84],"minimum":[75,81],"cover":[77,83],"exponentially":[87],"faster":[88],"than":[89],"existing":[90],"respect":[93],"to":[94,109],"$\\frac{1}{\\epsilon}$.":[97],"Our":[98],"problem":[105],"can":[106],"be":[107],"transformed":[108],"two-sided":[111],"tester":[113,131],"property":[116,134],"having":[118],"perfect":[120],"matching.":[121],"On":[122],"contrary,":[124],"every":[128],"one-sided":[129],"requires":[135],"at":[136],"least":[137],"$\\Omega(n)$":[138],"queries.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}