2024/02/05 by Aditi Dudeja, Dudeja, Aditi
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2402.03068
openalex publication_date 2024/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
In this note, we revisit the rounding algorithm of Wajc. Wajc gave a fully-adaptive randomized algorithm that rounds a dynamic fractional matching in an unweighted bipartite graph to an integral matching of nearly the same value in O(poly(log n,(1)/(ε))) update time. We give show that the guarantees of this algorithm hold for general graphs as well. Additionally, we show useful properties of this subroutine which have applications in rounding weighted fractional matchings.