![](images/graphics/blank.gif)
Software defined satellite network
-
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.
20p
danhnguyentuongvi27
19-12-2018
14
0
Download
CHỦ ĐỀ BẠN MUỐN TÌM
![](images/graphics/blank.gif)