## Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

- Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi
- 2007 International Conference on Parallel and…
- 2007

Highly Influenced

@article{Ghanwani1998NeuralAD, title={Neural and delay based heuristics for the Steiner problem in networks}, author={Anoop Ghanwani}, journal={European Journal of Operational Research}, year={1998}, volume={108}, pages={241-265} }

- Published 1998 in European Journal of Operational Research
DOI:10.1016/S0377-2217(97)00369-X

High speed networks such as the B-ISDN must be adequately equipped to handle multipoint communication in a fast and economical manner. Multicast applications include desktop video conferencing, distance learning, distributed database applications, etc. In networks employing the asynchronous transfer mode (ATM) technology, routing a multicast is achieved by constructing a tree that spans the source and all the destinations. For the purpose of routing, the network is modeled as a weighted… CONTINUE READING

### Presentations referencing similar topics