
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Given a graph with positive edge weights and a
positive integer m, the Constrained Forest Problem (CFP)
problem seeks a minimumweight spanning subgraph each of
whose components contains at least m vertices. Such a subgraph
is called an mforest. We present a genetic algorithm (GA) for
CFP, which is NPhard for me”4. Our GA evolves good spanning
trees, as determined by the weight of the mforest into which
it can be partitioned by a simple greedy algorithm. Genetic
operators include mutation, which replaces a spanning tree
edge by a different edge that connects the same pair of
components, and recombination, which combines the edge sets
of two spanning trees to produce two new spanning trees. The
GA discovers mforests that are significantly better than those
identified by bestknown approximation algorithms for CFP,
and identifies optimal solutions in small problems.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment