We improve the analysis of the greedy algorithm for the maximum edge dosjpint paths problem, and also describe a new algorithm with better performance.
