Read:

A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs

https://courses.grainger.illinois.edu/cs598csc/sp2009/Lectures/lecture_18.pdf

https://courses.cs.duke.edu/fall19/compsci638/fall19_notes/lecture5.pdf

https://www.cs.cmu.edu/~anupamg/adv-approx/lecture18.pdf

READ ALSO

https://math.mit.edu/~goemans/PAPERS/GoemansWilliamson-1995-AGeneralApproximationTechniqueForConstrainedForestProblems.pdf