| Polynomial Time Algorithms for (2003) | |||||||||||||||||
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 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. | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||