{"id":"https://openalex.org/W2900273937","doi":"https://doi.org/10.4230/lipics.esa.2020.76","title":"Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching","display_name":"Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching","publication_year":2018,"publication_date":"2018-11-05","ids":{"openalex":"https://openalex.org/W2900273937","doi":"https://doi.org/10.4230/lipics.esa.2020.76","mag":"2900273937"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12942","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.76","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":["arxiv","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.76","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Panagiotas, Ioannis","orcid":"https://orcid.org/0000-0002-1081-2411"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"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":["FR","US"],"is_corresponding":false,"raw_author_name":"Panagiotas, Ioannis","raw_affiliation_strings":["ENS Lyon, France","#N#               * University of Pennsylvania"],"raw_orcid":"https://orcid.org/0000-0002-1081-2411","affiliations":[{"raw_affiliation_string":"ENS Lyon, France","institution_ids":["https://openalex.org/I113428412"]},{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":["https://openalex.org/I36788626","https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":null,"display_name":"U\u00e7ar, Bora","orcid":"https://orcid.org/0000-0002-4960-3545"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"U\u00e7ar, Bora","raw_affiliation_strings":["CNRS and LIP, ENS Lyon, France","SAS - Computer Science"],"raw_orcid":"https://orcid.org/0000-0002-4960-3545","affiliations":[{"raw_affiliation_string":"CNRS and LIP, ENS Lyon, France","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I4210144566"]},{"raw_affiliation_string":"SAS - Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3789,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.65070673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"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.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"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.7598016262054443},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6879895925521851},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6705610752105713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5328187346458435},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.47947463393211365},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4746095538139343},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.435374915599823},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4168258607387543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4030890464782715},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39676597714424133},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37804800271987915},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3408767879009247},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2334035038948059}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7598016262054443},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6879895925521851},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6705610752105713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5328187346458435},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.47947463393211365},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4746095538139343},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.435374915599823},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4168258607387543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4030890464782715},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39676597714424133},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37804800271987915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3408767879009247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2334035038948059},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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:12942","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.76","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:arXiv.org:1811.02009","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.02009","pdf_url":"https://arxiv.org/pdf/1811.02009","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1811.02009","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1811.02009","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.esa.2020.76","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2020.76","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12942","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.76","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1570983058","https://openalex.org/W1595640791","https://openalex.org/W1639030016","https://openalex.org/W1985061810","https://openalex.org/W2018956470","https://openalex.org/W2019040312","https://openalex.org/W2031536548","https://openalex.org/W2051540665","https://openalex.org/W2063292248","https://openalex.org/W2063844956","https://openalex.org/W2068871408","https://openalex.org/W2068888615","https://openalex.org/W2082352769","https://openalex.org/W2092534058","https://openalex.org/W2129575457","https://openalex.org/W2162740996","https://openalex.org/W2199907825","https://openalex.org/W2261727491","https://openalex.org/W2413699622","https://openalex.org/W2419092805","https://openalex.org/W2492999734","https://openalex.org/W2569757174","https://openalex.org/W2604904214","https://openalex.org/W2612033967","https://openalex.org/W2617896681","https://openalex.org/W2962710457","https://openalex.org/W2962958397","https://openalex.org/W2963583531","https://openalex.org/W2964005090","https://openalex.org/W2964336535"],"related_works":["https://openalex.org/W2077309407","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W2371352078","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2362975861","https://openalex.org/W2804963084"],"abstract_inverted_index":{"In":[0],"this":[1,35,128],"paper,":[2],"we":[3,191],"present":[4],"a":[5,8,13,169,185,194,208],"construction":[6],"of":[7,16,30,66,101,139,145,156,180,198,214],"`matching":[9],"sparsifier',":[10],"that":[11,20,201],"is,":[12],"sparse":[14],"subgraph":[15,143],"the":[17,31,45,57,63,88,97,114,123,140,154,181,189,199],"given":[18],"graph":[19],"preserves":[21],"large":[22,209],"matchings":[23,158],"approximately":[24],"and":[25,69,73,94,104,147,177],"is":[26,122,133,204],"robust":[27],"to":[28,38,79,119,174,206],"modifications":[29],"graph.":[32],"We":[33],"use":[34],"matching":[36,47,59,90,116,131,170],"sparsifier":[37,132],"obtain":[39],"several":[40],"new":[41,137],"algorithmic":[42],"results":[43,183],"for":[44,56,87,113,127,168],"maximum":[46,58],"problem:":[48],"*":[49,82,108],"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],"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)---designed":[152],"in":[153,159,184],"context":[155],"maintaining":[157],"dynamic":[160],"graphs---that":[161],"identifies":[162],"EDCS":[163,203],"as":[164],"an":[165,202],"excellent":[166],"choice":[167],"sparsifier.":[171],"This":[172],"leads":[173],"surprisingly":[175],"simple":[176],"non-technical":[178],"proofs":[179],"above":[182],"unified":[186],"way.":[187],"Along":[188],"way,":[190],"also":[192],"provide":[193],"much":[195],"simpler":[196],"proof":[197],"fact":[200],"guaranteed":[205],"contain":[207],"matching,":[210],"which":[211],"may":[212],"be":[213],"independent":[215],"interest.":[216]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2018-11-16T00:00:00"}