« first day (4619 days earlier)      last day (37 days later) » 

Feeds
Feeds
10:03
2
Q: Can the Ford-Fulkerson Algorithm Guarantee Absolute Constant Approximation Without Back Edges?

NoahI've been struggling with this homework question where the Ford-Fulkerson algorithm is modified to remove reverse edges from the residual graph. I tried to disprove that this approach can guarantee an absolute constant approximation factor by constructing a counterexample. However, all the counte...

algorithms graphs approximation network-flow ford-fulkerson

« first day (4619 days earlier)      last day (37 days later) »