Polynomial Time Algorithms for Network Information Flow Export

@misc{citeulike:582439, abstract = {The famous max-flow min-cut theorem states that a source node s can send information through a network (V; E) to a sink node t at a data rate determined by the min-cut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to reencode the information they receive. In contrast, we present graphs where without coding the rate must be a factor jV j) smaller. However, so far no fast...}, author = {Sanders, P. and Egner, S. and Tolhuizen, L.}, citeulike-article-id = {582439}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5764}, keywords = {algorithm, network-coding}, posted-at = {2006-04-12 04:23:55}, priority = {4}, title = {Polynomial Time Algorithms for Network Information Flow}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5764} }

TY - GEN ID - citeulike:582439 L3 - citeulike-article-id:582439 N2 - The famous max-flow min-cut theorem states that a source node s can send information through a network (V; E) to a sink node t at a data rate determined by the min-cut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to reencode the information they receive. In contrast, we present graphs where without coding the rate must be a factor jV j) smaller. However, so far no fast... TI - Polynomial Time Algorithms for Network Information Flow KW - algorithm KW - network-coding AU - Sanders, P AU - Egner, S AU - Tolhuizen, L UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5764 ER -