Encoding rectilinear Steiner trees as lists of edges

Authors:
Bryant A. Julstrom
Affiliations:
Department of Computer Science, St. Cloud State University, 720 Fourth Avenue South, St. Cloud, MN
Venue:
Proceedings of the 2001 ACM symposium on Applied computing
Year:
2001

Citing 3
Cited 6

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Representing rectilinear Steiner trees in genetic algorithms

SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Data Structures and Algorithms

Data Structures and Algorithms

A spanning-tree-based genetic algorithm for some instances of the rectilinear Steiner problem with obstacles

Proceedings of the 2003 ACM symposium on Applied computing
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Proceedings of the 2003 ACM symposium on Applied computing
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem

Proceedings of the 2004 ACM symposium on Applied computing
A tree-based genetic algorithm for building rectilinear Steiner arborescences

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A hybrid evolutionary algorithm for the euclidean steiner tree problem using local searches

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Hybrid evolutionary algorithms for the rectilinear steiner tree problem using fitness estimation

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract