ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Distributed algorithms for multicast path setup in data networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Greedy algorithms for the on-line steiner tree and generalized steiner problemsPublished by Springer Nature ,1993
- Steiner's problem in graphs: heuristic methodsDiscrete Applied Mathematics, 1992
- Path-distance heuristics for the Steiner problem in undirected networksAlgorithmica, 1992
- Multicasting for multimedia applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Graph theoretic models for multicast communicationsComputer Networks and ISDN Systems, 1990
- An SST‐based algorithm for the steiner problem in graphsNetworks, 1989
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Steiner problem in networks: A surveyNetworks, 1987
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983