A survey of combinatorial optimization problems in multicast routing

@article{Oliveira2005ASO,
  title={A survey of combinatorial optimization problems in multicast routing},
  author={Carlos A. S. Oliveira and Panos M. Pardalos},
  journal={Computers & OR},
  year={2005},
  volume={32},
  pages={1953-1981}
}
In multicasting routing, the main objective is to send data from one or more source to multiple destinations, while at the same time minimizing the usage of resources. Examples of resources which can be minimized include bandwidth, time and connection costs. In this paper we survey applications of combinatorial optimization to multicast routing. We discuss the most important problems considered in this area, as well as their models. Algorithms for each of the main problems are also presented. 
98 Citations
105 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 98 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 105 references

C

  • R. Sriram, G. Manimaran
  • Siva Ram Murthy, A rearrangeable algorithm for…
  • 1999
Highly Influential
7 Excerpts

Two distributed algorithms for the constrained Steiner tree problem

  • V. Kompella, J. Pasquale, G. Polyzos
  • in: Proceedings of the Second International…
  • 1993
Highly Influential
4 Excerpts

OSPF network design solutions

  • II T. Thomas
  • Cisco Systems
  • 1998
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…