{"id":"https://openalex.org/W2963562941","doi":"https://doi.org/10.4230/oasics.sosa.2019.11","title":"Towards a Unified Theory of Sparsification for Matching Problems","display_name":"Towards a Unified Theory of Sparsification for Matching Problems","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2963562941","doi":"https://doi.org/10.4230/oasics.sosa.2019.11","mag":"2963562941"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:10037","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.11","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.11","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060978295","display_name":"Sepehr Assadi","orcid":"https://orcid.org/0009-0006-8914-5995"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]},{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Assadi, Sepehr","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":["https://openalex.org/I36788626","https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033889707","display_name":"Aaron Bernstein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bernstein, Aaron","raw_affiliation_strings":["SAS - Computer Science"],"affiliations":[{"raw_affiliation_string":"SAS - Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060978295"],"corresponding_institution_ids":["https://openalex.org/I36788626","https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":3.1999,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92716063,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":"69","first_page":"20","last_page":null},"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.9940000176429749,"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.9940000176429749,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9936000108718872,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9879000186920166,"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/mathematical-proof","display_name":"Mathematical proof","score":0.7338255047798157},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6485520005226135},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6250354051589966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5771088004112244},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5372353196144104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42952072620391846},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.42367878556251526},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4232543110847473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4025675654411316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3836246132850647},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37791794538497925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3646814823150635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2577112913131714}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7338255047798157},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6485520005226135},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6250354051589966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5771088004112244},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5372353196144104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42952072620391846},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.42367878556251526},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4232543110847473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4025675654411316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3836246132850647},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37791794538497925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3646814823150635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2577112913131714},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:10037","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.11","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:alma.01RUT_INST:11663536430004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/other/Towards-a-Unified-Theory-of-Sparsification/991031654713004646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Other"},{"id":"doi:10.4230/oasics.sosa.2019.11","is_oa":true,"landing_page_url":"https://doi.org/10.4230/oasics.sosa.2019.11","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2963562941","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2018/10037/pdf/OASIcs-SOSA-2019-11.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:10037","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.11","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7199851301","display_name":"AF: Small: Sublinear Algorithms for Graph Optimization Problems","funder_award_id":"1617851","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2900273937","https://openalex.org/W1639030016","https://openalex.org/W2962710457","https://openalex.org/W2492999734","https://openalex.org/W2261727491","https://openalex.org/W3003639791","https://openalex.org/W2948325253","https://openalex.org/W2346400836","https://openalex.org/W3126947642","https://openalex.org/W2618794602","https://openalex.org/W2963891649","https://openalex.org/W570339359","https://openalex.org/W853930207","https://openalex.org/W3099044340","https://openalex.org/W3037335885","https://openalex.org/W2964336535","https://openalex.org/W2964005090","https://openalex.org/W2612033967","https://openalex.org/W1595640791","https://openalex.org/W2964260368"],"abstract_inverted_index":{"In":[0],"this":[1,35,128],"paper,":[2],"we":[3,195],"present":[4],"a":[5,8,13,173,189,198,212],"construction":[6],"of":[7,16,30,66,101,139,145,158,184,202,218],"\"matching":[9],"sparsifier\",":[10],"that":[11,20,165,205],"is,":[12],"sparse":[14],"subgraph":[15,143],"the":[17,31,45,57,63,88,97,114,123,140,156,185,193,203],"given":[18],"graph":[19],"preserves":[21],"large":[22,213],"matchings":[23,160],"approximately":[24],"and":[25,69,73,94,104,147,181],"is":[26,122,133,208],"robust":[27],"to":[28,38,79,119,178,210],"modifications":[29],"graph.":[32],"We":[33],"use":[34],"matching":[36,47,59,90,116,131,174],"sparsifier":[37,132],"obtain":[39],"several":[40],"new":[41,137],"algorithmic":[42],"results":[43,187],"for":[44,56,87,113,127,172],"maximum":[46,58],"problem:":[48],"-":[49,82,108,153,164],"An":[50,83,109],"almost":[51,84,110],"(3/2)-approximation":[52,64,85,111],"one-way":[53],"communication":[54],"protocol":[55,65],"problem,":[60,91,117],"significantly":[61,95],"simplifying":[62,96],"Goel,":[67],"Kapralov,":[68],"Khanna":[70],"(SODA":[71],"2012)":[72],"extending":[74],"it":[75],"from":[76],"bipartite":[77],"graphs":[78,163],"general":[80],"graphs.":[81],"algorithm":[86,100,112,126],"stochastic":[89],"improving":[92],"upon":[93],"previous":[98],"1.999-approximation":[99],"Assadi,":[102],"Khanna,":[103],"Li":[105],"(EC":[106],"2017).":[107],"fault-tolerant":[115],"which,":[118],"our":[120],"knowledge,":[121],"first":[124],"non-trivial":[125],"problem.":[129],"Our":[130],"obtained":[134],"by":[135],"proving":[136],"properties":[138],"edge-degree":[141],"constrained":[142],"(EDCS)":[144],"Bernstein":[146],"Stein":[148],"(ICALP":[149],"2015;":[150],"SODA":[151],"2016)":[152],"designed":[154],"in":[155,161,188],"context":[157],"maintaining":[159],"dynamic":[162],"identifies":[166],"EDCS":[167,207],"as":[168],"an":[169,206],"excellent":[170],"choice":[171],"sparsifier.":[175],"This":[176],"leads":[177],"surprisingly":[179],"simple":[180],"non-technical":[182],"proofs":[183],"above":[186],"unified":[190],"way.":[191],"Along":[192],"way,":[194],"also":[196],"provide":[197],"much":[199],"simpler":[200],"proof":[201],"fact":[204],"guaranteed":[209],"contain":[211],"matching,":[214],"which":[215],"may":[216],"be":[217],"independent":[219],"interest.":[220]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}