1. Pacs: Chopping and shuffling large contents for faster opportunistic dissemination;Belblidia,2011
2. Bhadra, S. Ferreira, A. (2002). Computing multicast trees in dynamic networks using evolving graphs: Research report 4531. INRIA.
3. Evolving graphs and least cost journeys in dynamic networks;Bui-Xuan,2003
4. Hardness and approximation results for packing steiner trees;Cheriyan;Algorithmica,2006
5. Minimal multicut and maximal integer multiflow: A survey;Costa;European Journal of Operational Research,2005