{"id":"https://openalex.org/W2096413587","doi":"https://doi.org/10.1145/1806689.1806753","title":"Maintaining a large matching and a small vertex cover","display_name":"Maintaining a large matching and a small vertex cover","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2096413587","doi":"https://doi.org/10.1145/1806689.1806753","mag":"2096413587"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806753","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806753","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-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/72534","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040763434","display_name":"Krzysztof Onak","orcid":"https://orcid.org/0000-0003-0226-7449"},"institutions":[{"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":"Krzysztof Onak","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041567023","display_name":"Ronitt Rubinfeld","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronitt Rubinfeld","raw_affiliation_strings":["MIT / Tel Aviv University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT / Tel Aviv University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3832,"has_fulltext":false,"cited_by_count":102,"citation_normalized_percentile":{"value":0.95101324,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"457","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":0.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8364298343658447},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.7912443280220032},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6220464110374451},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5784921050071716},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5539933443069458},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5497543811798096},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5345090627670288},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5117478370666504},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49398475885391235},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41472476720809937},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4137672185897827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37357673048973083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3465670049190521},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2778155505657196},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07824838161468506}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8364298343658447},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.7912443280220032},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6220464110374451},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5784921050071716},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5539933443069458},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5497543811798096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5345090627670288},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5117478370666504},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49398475885391235},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41472476720809937},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4137672185897827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37357673048973083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3465670049190521},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2778155505657196},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07824838161468506},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1806689.1806753","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806753","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-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.173.275","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/konak/download/publications/Onak_Rubinfeld-maintaining_large_matching.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/72534","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72534","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/72534","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72534","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2888019359","display_name":null,"funder_award_id":"1675/09","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G3963712539","display_name":"MSPA-MCS: Learning to Rank","funder_award_id":"0732334","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3970753504","display_name":null,"funder_award_id":"1147/09","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G5087765963","display_name":"Fast Approximate Algorithms for Wireless Sensor Networks","funder_award_id":"0728645","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1514707655","https://openalex.org/W1582032289","https://openalex.org/W1612498707","https://openalex.org/W1980155175","https://openalex.org/W1992869351","https://openalex.org/W2003813631","https://openalex.org/W2009695707","https://openalex.org/W2028558845","https://openalex.org/W2029185453","https://openalex.org/W2031592993","https://openalex.org/W2058084873","https://openalex.org/W2065295938","https://openalex.org/W2145593504","https://openalex.org/W2158560363","https://openalex.org/W2165753192","https://openalex.org/W2570637728","https://openalex.org/W2752885492","https://openalex.org/W3004540582","https://openalex.org/W3145128584","https://openalex.org/W4244805165","https://openalex.org/W4285719527","https://openalex.org/W6629976909","https://openalex.org/W6634945277","https://openalex.org/W6826464809"],"related_works":["https://openalex.org/W2551034790","https://openalex.org/W2029933769","https://openalex.org/W2047424666","https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1548167816","https://openalex.org/W1502438505","https://openalex.org/W2125212169","https://openalex.org/W1968988491","https://openalex.org/W2538178083"],"abstract_inverted_index":{"We":[0,33],"consider":[1],"the":[2,22,35,60,65],"problem":[3],"of":[4,51,62,74],"maintaining":[5],"a":[6,10,15,43,49,71],"large":[7],"matching":[8],"and":[9,47],"small":[11],"vertex":[12],"cover":[13],"in":[14,54,64],"dynamically":[16],"changing":[17],"graph.":[18,66],"Each":[19],"update":[20],"to":[21],"graph":[23],"is":[24,59],"either":[25],"an":[26,30],"edge":[27,31],"deletion":[28],"or":[29],"insertion.":[32],"give":[34],"first":[36],"randomized":[37],"data":[38,68],"structure":[39],"that":[40],"simultaneously":[41],"achieves":[42],"constant":[44],"approximation":[45],"factor":[46],"handles":[48],"sequence":[50],"K":[52],"updates":[53],"K*polylog(n)":[55],"time,":[56],"where":[57],"n":[58],"number":[61],"vertices":[63],"Previous":[67],"structures":[69],"require":[70],"polynomial":[72],"amount":[73],"computation":[75],"per":[76],"update.":[77]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}