On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths

The paper presents a comparison between three approaches to solving the length-bounded maximum multicommodity flow problem with unit edge-lengths. Following the first approach, Garg and Konemann’s, we developed an improved fully polynomial time approximation scheme for this problem. As the second alternative, we considered the well-known greedy approach.