Nanongkai, Danupon Algorithms and Complexity, MPI for Informatics, Max Planck Society;
https://epubs.siam.org/doi/reader/10.1137/1.9781611977554.ch10 (Verlagsversion)
Li, J., Nanongkai, D., Panigrahi, D., & Saranurak, T. (2023). Near-Linear Time Approximations for Cut Problems via Fair Cuts. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 240-257). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch10.