{"id":"https://openalex.org/W1991832118","doi":"https://doi.org/10.1145/1250790.1250809","title":"Simple deterministic approximation algorithms for counting matchings","display_name":"Simple deterministic approximation algorithms for counting matchings","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W1991832118","doi":"https://doi.org/10.1145/1250790.1250809","mag":"1991832118"},"language":"en","primary_location":{"id":"doi:10.1145/1250790.1250809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth 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/A5091599934","display_name":"Mohsen Bayati","orcid":"https://orcid.org/0000-0002-7280-912X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohsen Bayati","raw_affiliation_strings":["Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031648070","display_name":"David Gamarnik","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Gamarnik","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008310006","display_name":"Dimitriy Katz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitriy Katz","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073405189","display_name":"Chandra Nair","orcid":"https://orcid.org/0000-0003-2745-5614"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chandra Nair","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047220138","display_name":"Prasad Tetali","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I2800444561","display_name":"Atlanta Technical College","ror":"https://ror.org/01s3vfp47","country_code":"US","type":"education","lineage":["https://openalex.org/I2800444561"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Tetali","raw_affiliation_strings":["Georgia Tech, Atlanta, GA","Georgia Tech, Atlanta, Ga"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Tech, Atlanta, GA","institution_ids":["https://openalex.org/I130701444","https://openalex.org/I2800444561"]},{"raw_affiliation_string":"Georgia Tech, Atlanta, Ga","institution_ids":["https://openalex.org/I130701444","https://openalex.org/I2800444561"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"122","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9994000196456909,"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.998199999332428,"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/time-complexity","display_name":"Time complexity","score":0.6040191650390625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5820118188858032},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.579288125038147},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5373735427856445},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5356976389884949},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.506909191608429},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5007305145263672},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47709351778030396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44314053654670715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4377749264240265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43065518140792847},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.428948312997818},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4133712351322174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32909393310546875}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6040191650390625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5820118188858032},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.579288125038147},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5373735427856445},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5356976389884949},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.506909191608429},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5007305145263672},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47709351778030396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44314053654670715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4377749264240265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43065518140792847},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.428948312997818},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4133712351322174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32909393310546875},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1250790.1250809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.3706","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.3706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://chandra.ie.cuhk.edu.hk/pub/papers/CM-stoc07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W634962210","https://openalex.org/W982707038","https://openalex.org/W1568495775","https://openalex.org/W1607251184","https://openalex.org/W1619473509","https://openalex.org/W1965412489","https://openalex.org/W1972778238","https://openalex.org/W1972885539","https://openalex.org/W1976445742","https://openalex.org/W1986705527","https://openalex.org/W1990313671","https://openalex.org/W2002707254","https://openalex.org/W2004724832","https://openalex.org/W2006912660","https://openalex.org/W2012041962","https://openalex.org/W2023313458","https://openalex.org/W2037389370","https://openalex.org/W2051283034","https://openalex.org/W2055519174","https://openalex.org/W2055649245","https://openalex.org/W2062041836","https://openalex.org/W2071824433","https://openalex.org/W2096192733","https://openalex.org/W2096626276","https://openalex.org/W2110552005","https://openalex.org/W2113770815","https://openalex.org/W2131320899","https://openalex.org/W2161611531","https://openalex.org/W2610680804","https://openalex.org/W2611336766","https://openalex.org/W2807232057","https://openalex.org/W2952052331","https://openalex.org/W3111890340","https://openalex.org/W4244121195","https://openalex.org/W4386648629"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W2007715402","https://openalex.org/W3097369619","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W4287692398","https://openalex.org/W3047118271","https://openalex.org/W3144947242"],"abstract_inverted_index":{"We":[0],"construct":[1],"a":[2,26],"deterministic":[3,27],"fully":[4],"polynomial":[5],"time":[6,37],"approximationscheme":[7],"(FPTAS)":[8],"for":[9,21,29],"computing":[10,30],"the":[11,42],"total":[12],"number":[13,43],"of":[14,33,44],"matchings":[15,34],"in":[16],"abounded":[17],"degree":[18],"graph.":[19],"Additionally,":[20],"an":[22],"arbitrary":[23],"graph,":[24],"weconstruct":[25],"algorithm":[28],"approximately":[31],"thenumber":[32],"within":[35],"running":[36],"exp(O(\u221an":[38],"log2n)),where":[39],"n":[40],"is":[41],"vertices.":[45]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":9}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}