Kiss, Peter Algorithms and Complexity, MPI for Informatics, Max Planck Society;
arXiv:2306.11828.pdf (Preprint), 695KB
Bhattacharya, S., Kiss, P., Sidford, A., & Wajc, D. (2024). Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. Retrieved from https://arxiv.org/abs/2306.11828.