Sciweavers

2 search results - page 1 / 1
» Hamilton Circuits in Hexagonal Grid Graphs
Sort
View
CCCG
2007
13 years 6 months ago
Hamilton Circuits in Hexagonal Grid Graphs
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid ...
Kamrul Islam, Henk Meijer, Yurai Núñ...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
13 years 10 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor