Abstract
In this chapter the authors present the following problem: some islands have to be connected via a system of bridges in such a way that it is possible to drive from each island to each other, but the number of bridges and their sizes have to be as small as possible. This problem, finding a minimum spanning tree, has many different practical applications aside from building bridges – examples include chip design, traffic planning and communication networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Skutella, K., Skutella, M. (2011). Minimum Spanning Trees - Sometimes Greed Pays Off. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)