Minimum Spanning Trees

Gerard Sierksma () and Diptesh Ghosh ()
Additional contact information
Gerard Sierksma: Fac. Economische Wetenschappen Rijksuniversiteit Groningen

Chapter 2 in Networks in Action, 2010, pp 37-60 from Springer

Abstract: Abstract GTC has been assigned the job of interconnecting six departments, labeled A, B, C, D, E, and F, of a university, at minimum cost. Practical considerations make it impossible to connect several pairs of departments directly to one another. In fact the only direct connections possible are the ones between departments A and B, A and D, B and C, B and D, B and E, C and D, C and F, D and E, and E and F. These connections are shown in the network of Figure 2.1, in which the nodes correspond to departments and edges correspond to possible direct connections. The numbers next to the edges denote the cost of making those connections in “100 units. GTC is required to connect the six departments as cheaply as possible.

Keywords: Span Tree; Access Point; Minimum Span Tree; Steiner Tree Problem; Linear Programming Formulation (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-5513-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9781441955135

DOI: 10.1007/978-1-4419-5513-5_5

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().