701 search results - page 32 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
113
click to vote
EVOW
2006
Springer
15 years 6 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
141
click to vote
ISAAC
1998
Springer
15 years 7 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
153
click to vote
SGP
2007
15 years 5 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
107
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
135
click to vote
SAC
2000
ACM
15 years 7 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...