{"id":"https://openalex.org/W4399521586","doi":"https://doi.org/10.1145/3618260.3649648","title":"Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs","display_name":"Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399521586","doi":"https://doi.org/10.1145/3618260.3649648"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649648","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649648","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649648","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649648","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103251160","display_name":"Sayan Bhattacharya","orcid":"https://orcid.org/0000-0003-1612-0296"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sayan Bhattacharya","raw_affiliation_strings":["University of Warwick, Coventry, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-1612-0296","affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026856828","display_name":"P\u00e9ter Kiss","orcid":"https://orcid.org/0009-0005-6488-9990"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter Kiss","raw_affiliation_strings":["University of Warwick, Coventry, United Kingdom"],"raw_orcid":"https://orcid.org/0009-0005-6488-9990","affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086787265","display_name":"Aaron Sidford","orcid":"https://orcid.org/0000-0003-2675-7610"},"institutions":[{"id":"https://openalex.org/I1743320","display_name":"Palo Alto University","ror":"https://ror.org/04f812k67","country_code":"US","type":"education","lineage":["https://openalex.org/I1743320"]},{"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":"Aaron Sidford","raw_affiliation_strings":["Stanford University, Palo Alto, USA"],"raw_orcid":"https://orcid.org/0000-0003-2675-7610","affiliations":[{"raw_affiliation_string":"Stanford University, Palo Alto, USA","institution_ids":["https://openalex.org/I1743320","https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033052575","display_name":"David Wajc","orcid":"https://orcid.org/0000-0003-1896-2948"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Wajc","raw_affiliation_strings":["Technion, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0003-1896-2948","affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0435,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.84948883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"70"},"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.9973999857902527,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.87754225730896},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8376436233520508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6219282150268555},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.611678957939148},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5516433119773865},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.5274505615234375},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4901607930660248},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.46973738074302673},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4446384906768799},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.42945975065231323},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4256080389022827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4023898243904114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3799206018447876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28599491715431213}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.87754225730896},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8376436233520508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6219282150268555},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.611678957939148},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5516433119773865},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.5274505615234375},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4901607930660248},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.46973738074302673},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4446384906768799},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.42945975065231323},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4256080389022827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4023898243904114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3799206018447876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28599491715431213},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3618260.3649648","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649648","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649648","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:185067","is_oa":true,"landing_page_url":"https://wrap.warwick.ac.uk/id/eprint/185067/1/WRAP-near-optimal-dynamic-rounding-Bhattacharya-2024.pdf","pdf_url":"https://wrap.warwick.ac.uk/id/eprint/185067/7/WRAP-near-optimal-dynamic-rounding-Bhattacharya-2024.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649648","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649648","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649648","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3947296455","display_name":"Theory and Applications of Dynamic Algorithms","funder_award_id":"EP/S03353X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399521586.pdf","grobid_xml":"https://content.openalex.org/works/W4399521586.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1569871753","https://openalex.org/W1580420215","https://openalex.org/W1756477312","https://openalex.org/W1983248819","https://openalex.org/W1999848117","https://openalex.org/W2047281923","https://openalex.org/W2096413587","https://openalex.org/W2146507303","https://openalex.org/W2153715991","https://openalex.org/W2178621981","https://openalex.org/W2327315803","https://openalex.org/W2341465683","https://openalex.org/W2509544990","https://openalex.org/W2898134584","https://openalex.org/W2913507641","https://openalex.org/W2949942995","https://openalex.org/W2950039944","https://openalex.org/W2951652158","https://openalex.org/W2963123599","https://openalex.org/W2964007887","https://openalex.org/W2971415725","https://openalex.org/W2972220082","https://openalex.org/W2972259791","https://openalex.org/W2974991453","https://openalex.org/W3035470141","https://openalex.org/W3127776752","https://openalex.org/W3193792594","https://openalex.org/W3212455957","https://openalex.org/W4205734203","https://openalex.org/W4235789583","https://openalex.org/W4313203312","https://openalex.org/W4316652263","https://openalex.org/W4316652350","https://openalex.org/W4316652388","https://openalex.org/W4376639570","https://openalex.org/W4377200029","https://openalex.org/W4380538511","https://openalex.org/W4399521586"],"related_works":["https://openalex.org/W2348257368","https://openalex.org/W2054458431","https://openalex.org/W2077309407","https://openalex.org/W2352066879","https://openalex.org/W1592682627","https://openalex.org/W2561454982","https://openalex.org/W2371352078","https://openalex.org/W2184969544","https://openalex.org/W4232683556","https://openalex.org/W4390575960"],"abstract_inverted_index":{"We":[0],"study":[1],"dynamic":[2,15,77],"(1\u2212\u0454)-approximate":[3],"rounding":[4,27,79,116],"of":[5,47,90,146],"fractional":[6,66,123],"matchings\u2014a":[7],"key":[8],"ingredient":[9],"in":[10,13,29,64],"numerous":[11],"breakthroughs":[12],"the":[14,60,65,137],"graph":[16],"algorithms":[17,80,91,126,135],"literature.":[18],"Our":[19],"first":[20],"contribution":[21],"is":[22,68],"a":[23,88,102],"surprisingly":[24],"simple":[25],"deterministic":[26],"algorithm":[28,74,105],"bipartite":[30,124,139],"graphs":[31,151],"with":[32,75,106,127],"amortized":[33],"update":[34,56],"time":[35,57,110],"O(\u0454\u22121":[36],"log2":[37],"(\u0454\u22121":[38],"\u00b7":[39,108],"n)),":[40],"matching":[41,67,125,140],"an":[42],"(unconditional)":[43],"recourse":[44],"lower":[45,69],"bound":[46],"\u03a9(\u0454\u22121)":[48],"up":[49],"to":[50,81,149,153],"logarithmic":[51],"factors.":[52],"Moreover,":[53],"this":[54,73,83,94],"algorithm\u2019s":[55],"improves":[58],"provided":[59],"minimum":[61,84],"(non-zero)":[62],"weight":[63],"bounded":[70],"throughout.":[71],"Combining":[72],"novel":[76],"partial":[78],"increase":[82],"weight,":[85],"we":[86,100,118,143],"obtain":[87],"number":[89],"that":[92],"improve":[93],"dependence":[95],"on":[96,133],"n.":[97],"For":[98],"example,":[99],"give":[101],"high-probability":[103],"randomized":[104],"\u00d5(\u0454\u22121":[107],"(loglogn)2)-update":[109],"against":[111],"adaptive":[112],"adversaries.":[113],"Using":[114],"our":[115,147],"algorithms,":[117],"also":[119],"round":[120],"known":[121],"(1\u2212\u0454)-decremental":[122],"no":[128],"asymptotic":[129],"overhead,":[130],"thus":[131],"improving":[132],"state-of-the-art":[134],"for":[136],"decremental":[138],"problem.":[141],"Further,":[142],"provide":[144],"extensions":[145],"results":[148],"general":[150],"and":[152],"maintaining":[154],"almost-maximal":[155],"matchings.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}