1494 search results - page 1 / 299 » Polynomial time algorithms for network information flow |
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
AMC
2008
13 years 5 months ago
2008
SODA
2000
ACM
13 years 6 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
NETWORKS
2011
12 years 11 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...