Minimum cost 2-edge-connected Steiner graphs in rectilinear space: an evolutionary approach.
Sadan Kulturel-KonakAbdullah KonakAlice E. SmithPublished in: CEC (2000)
Keyphrases
- minimum cost
- undirected graph
- spanning tree
- approximation algorithms
- np hard
- minimum spanning tree
- network flow
- weighted graph
- network flow problem
- network simplex algorithm
- edge weights
- graph theoretic
- connected components
- search space
- directed graph
- capacity constraints
- minimal surface
- graph matching
- edge detection
- graph mining
- graph structure
- graph representation
- mobile robot
- evolutionary algorithm
- strongly connected