A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Edge-disjoint paths revisited

2007
*
ACM Transactions on Algorithms
*

The approximability of the maximum edge disjoint paths problem (EDP) in directed graphs was seemingly settled by the fl(ml/2-e)-hardness result of Guruswami et al. [10] and the O(x/~ ) approximation achievable via both the natural LP relaxation [19] and the greedy algorithm [11, 12] . Here m is the number of edges in the graph. However, we observe that the hardness of approximation shown in [10] applies to sparse graphs and hence when expressed as a function of n, the number of vertices, only

doi:10.1145/1290672.1290683
fatcat:7vyztvdf7rfwxcnfdfkdgzhjbe