Skip to main content

Minimum Spanning Trees Made Easier

  • Chapter

Part of the Natural Computing Series book series (NCS)

Abstract

In the previous chapter, we analyzed simple MOEAs on a given multi-objective optimization problem. In this chapter, we consider a multi-objective model of the minimum spanning tree problem. A single-objective model for the computation of minimum spanning trees has already been examined in Chapter 5. Our goal is to show that sometimes single-objective optimization problems can be solved much more easily by using a multi-objective model of the problem. This approach has opened a new research area in the field of multi-objective optimization and we want to discuss different results in the remainder of this book.

Keywords

  • Pareto Front
  • Minimum Span Tree
  • Search Point
  • Graph Class
  • Minimum Span Tree Problem

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-16544-3_11
  • Chapter length: 9 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-16544-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Hardcover Book
USD   99.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carsten Witt .

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Neumann, F., Witt, C. (2010). Minimum Spanning Trees Made Easier. In: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16544-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16544-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16543-6

  • Online ISBN: 978-3-642-16544-3

  • eBook Packages: Computer ScienceComputer Science (R0)