On constrained diameter and medium optimal spanning trees
When two weighting figures per arc must be considered in optimizing a network one has either to combine them in a single performance factor or to optimize the network with respect to one of them while respecting some constraint on the other. This work deals with trees, showing how the algorithm for finding the shortest spanning tree of a graph can be modified to handle some problems of this kind efficiently.
Unable to display preview. Download preview PDF.
- -L. Fratta, F. Maffioli and G. Tartara, (1971) "Synthesis of communication networks with reliability of links exponentially decreasing with their length" Int. Conf. on Comm. 1971, Montreal (Canada).Google Scholar
- -E.N. Gilbert and H.O. Pollack (1968) "Steiner minimal trees" SIAM J. Appl.Math. 16 No. 1 pp. 1–29.Google Scholar
- -A. Kerschenbaum and R. Van Slike (1972) "Computing Minimum Spanning Trees Efficiently" Proc. of 1972 ACM Conference, Boston (Mass).Google Scholar
- -E.L. Lawler (1972) "Optimal Cycles in Graphs and the Minimal Cost to Tima Ratio Problem", Memo No. ERL-M343, ERL, College of Engineering, UC Berkeley, (California).Google Scholar
- -F. Maffioli (1971) "On diameter constrained shortest spanning tree", Int. Rep. 71-10, LCE-IEE, Politecnico di Milano (Italy).Google Scholar
- -R.C. Prim (1957) "Shortest Connection Networks and some Generalizations" B.S.T.J. 26 pp. 1389–1401.Google Scholar
- -Shi-Kuo Chang (1972) "The generation of minimal trees with a Steiner Topology" J. of ACM 19, No. 4, pp. 699–711.Google Scholar