Skip to main content
SpringerLink
Log in

On constrained diameter and medium optimal spanning trees

  • Computer And Communication Networks
  • Conference paper
  • First Online:
5th Conference on Optimization Techniques Part II (Optimization Techniques 1973)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4))

Included in the following conference series:

  • 2416 Accesses

Abstract

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.

Partially supported by the Centro di Telecomunicazioni Spaziali del CNR, Milano, Italy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • -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 

Download references

Author information

Authors and Affiliations

  1. Istituto di Elettronica, Politecnico di Milano, Italy

    F. Maffioli

Authors
  1. F. Maffioli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

R. Conti A. Ruberti

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maffioli, F. (1973). On constrained diameter and medium optimal spanning trees. In: Conti, R., Ruberti, A. (eds) 5th Conference on Optimization Techniques Part II. Optimization Techniques 1973. Lecture Notes in Computer Science, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06600-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-06600-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06600-2

  • Online ISBN: 978-3-540-37909-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation