A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On Approximating the Sum-Rate for Multiple-Unicasts
[article]
2015
arXiv
pre-print
We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with k independent sources. Our approximation algorithm runs in polynomial time and yields an upper bound on the joint source entropy rate, which is within an O(^2 k) factor from the GNS cut. It further yields a vector-linear network code that achieves joint source entropy rate within an O(^2 k) factor from the GNS cut, but
arXiv:1504.05294v2
fatcat:r4tlubgisnh6hcs6h5snyfi62q