{"id":"https://openalex.org/W4381712837","doi":"https://doi.org/10.48550/arxiv.2306.11828","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":2023,"publication_date":"2023-06-20","ids":{"openalex":"https://openalex.org/W4381712837","doi":"https://doi.org/10.48550/arxiv.2306.11828"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2306.11828","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.11828","pdf_url":"https://arxiv.org/pdf/2306.11828","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2306.11828","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bhattacharya, Sayan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068138460","display_name":"P. Kiss","orcid":"https://orcid.org/0000-0002-4955-0308"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kiss, Peter","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086787265","display_name":"Aaron Sidford","orcid":"https://orcid.org/0000-0003-2675-7610"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sidford, Aaron","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033052575","display_name":"David Wajc","orcid":"https://orcid.org/0000-0003-1896-2948"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wajc, David","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103251160"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.9991999864578247,"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.9991999864578247,"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.9868999719619751,"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.9836999773979187,"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.8447092771530151},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.717684805393219},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7169524431228638},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.679589569568634},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5751035809516907},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5066424012184143},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4625600576400757},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.45907825231552124},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.45602932572364807},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.42833614349365234},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41632962226867676},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3996395766735077},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39651811122894287},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1296658217906952},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12671944499015808},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10352110862731934}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8447092771530151},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.717684805393219},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7169524431228638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.679589569568634},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5751035809516907},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5066424012184143},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4625600576400757},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.45907825231552124},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.45602932572364807},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.42833614349365234},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41632962226867676},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3996395766735077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39651811122894287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1296658217906952},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12671944499015808},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10352110862731934},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2306.11828","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.11828","pdf_url":"https://arxiv.org/pdf/2306.11828","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2306.11828","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2306.11828","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2306.11828","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.11828","pdf_url":"https://arxiv.org/pdf/2306.11828","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2893785016","display_name":"CAREER: Theory of Fast Graph Optimization","funder_award_id":"1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3318838114","display_name":null,"funder_award_id":"CCF-1955039","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3330119427","display_name":null,"funder_award_id":"EPSRC","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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"},{"id":"https://openalex.org/G5727344453","display_name":null,"funder_award_id":"CCF-1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7994237705","display_name":"Collaborative Research: AF: Medium: Foundations of Structured Optimization","funder_award_id":"1955039","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/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4381712837.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2174899211","https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W3166231268","https://openalex.org/W3042669702","https://openalex.org/W4294294408","https://openalex.org/W2913147187","https://openalex.org/W3037054849","https://openalex.org/W2033371793"],"abstract_inverted_index":{"We":[0],"study":[1],"dynamic":[2,17,79],"$(1-\u03b5)$-approximate":[3],"rounding":[4,29,132],"of":[5,49,162],"fractional":[6,68,139],"matchings":[7],"--":[8],"a":[9,25,102],"key":[10],"ingredient":[11],"in":[12,15,31,66,123],"numerous":[13],"breakthroughs":[14],"the":[16,62,67,124,153],"graph":[18],"algorithms":[19,82,91,142,151],"literature.":[20],"Our":[21],"first":[22],"contribution":[23],"is":[24,70],"surprisingly":[26],"simple":[27],"deterministic":[28],"algorithm":[30,76,105],"bipartite":[32,140,155],"graphs":[33,167],"with":[34,77,106,143],"amortized":[35],"update":[36,58],"time":[37,59,110],"$O(\u03b5^{-1}":[38],"\\log^2":[39],"(\u03b5^{-1}":[40],"\\cdot":[41],"n))$,":[42],"matching":[43,69,141,156],"an":[44],"(unconditional)":[45],"recourse":[46],"lower":[47,71],"bound":[48],"$\u03a9(\u03b5^{-1})$":[50],"up":[51],"to":[52,83,119,165,169],"logarithmic":[53],"factors.":[54],"Moreover,":[55],"this":[56,75,85,94],"algorithm's":[57],"improves":[60],"provided":[61],"minimum":[63,86],"(non-zero)":[64],"weight":[65],"bounded":[72],"throughout.":[73],"Combining":[74],"novel":[78],"\\emph{partial":[80],"rounding}":[81],"increase":[84],"weight,":[87],"we":[88,100,134,159],"obtain":[89],"several":[90],"that":[92],"improve":[93],"dependence":[95],"on":[96,149],"$n$.":[97],"For":[98],"example,":[99],"give":[101],"high-probability":[103],"randomized":[104],"$\\tilde{O}(\u03b5^{-1}\\cdot":[107],"(\\log\\log":[108],"n)^2)$-update":[109],"against":[111],"adaptive":[112],"adversaries.":[113],"(We":[114],"use":[115],"Soft-Oh":[116],"notation,":[117],"$\\tilde{O}$,":[118],"suppress":[120],"polylogarithmic":[121],"factors":[122],"argument,":[125],"i.e.,":[126],"$\\tilde{O}(f)=O(f\\cdot":[127],"\\mathrm{poly}(\\log":[128],"f))$.)":[129],"Using":[130],"our":[131,163],"algorithms,":[133],"also":[135],"round":[136],"known":[137],"$(1-\u03b5)$-decremental":[138],"no":[144],"asymptotic":[145],"overhead,":[146],"thus":[147],"improving":[148],"state-of-the-art":[150],"for":[152],"decremental":[154],"problem.":[157],"Further,":[158],"provide":[160],"extensions":[161],"results":[164],"general":[166],"and":[168],"maintaining":[170],"almost-maximal":[171],"matchings.":[172]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2023-06-24T00:00:00"}