Kerry Capp
- 1.Jfirgen Branke and Martin Middendorf. Searching for shortest common supersequences by means of a heuristic-based genetic algorithm. In J~rmo T. Alander, editor, Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications (~NWGA), Proceedings of the University of Vaasa Reports, pages 105-113, University of Vaasa, Vaasa, Finland, August 1996.Google Scholar
- 2.J. C. Davis and M. J. McCullagh. Display and Analysis of Spatial Data. Wiley, 1975.Google Scholar
- 3.Matthew T. Dickerson, Scott A. McElfresh, and Mark Montague. New algorithms and empirical findings on minimum weight triangulation heuristics. {n Proceedings of the Eleventh Annual Symposium on Computational Geometry, pages 238-247, New York, 1995. ACM Press. Google ScholarDigital Library
- 4.A. E. Eiben and J. K. van der H auw. Solving 3-SAT by GAs adapting constraint weights. In Proceedings of 1997 IEEE International Conference on Evolutionary Computation, pages 81-86. IEEE, IEEE Neural Network Council, Evolutionary Programming Society, IEEE, April 1997.Google ScholarCross Ref
- 5.L. S. Heath and S. V. Pemmaraju. New results for the minimum weight triangulation problem. Algorithmica, 12(3)'533-552, 1994.Google ScholarDigital Library
- 6.Bryant A. Julstrom. Representing rectilinear Steiner trees in genetic algorithms. In K. M. George, Janice H. Carroll, Dave Oppenheim. and Jim Hightower, editors, Applied Computing 1996: Official Program of the 1996 ACM Symposium on Applied Computing, pages 245-250, New York, 1996. ACM Press. Google ScholarDigital Library
- 7.Bryant A. Julstrom. Strings of weights as chromosomes in genetic algorithms for combinatorial problems. {n Jarmo T. Alander, editor, Proceedings of the Third Nordic Workshop on Genetic Algorithms and their Applications (3NWGA), August 1997.Google Scholar
- 8.A. Lingas. The greedy Delaunay tria~ngulations are not bad in the average case and minimum weight triangulation of multi-connected polygons is N P- complete. In Foundations of Computation Theory, number 158 in Lecture Notes in Computer Science, pages 270-284. Springer-Verlag, Berlin, 1983. Google ScholarDigital Library
- 9.Erol Lynn Lloyd. On triangulations of a set of points in the plane. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 228-240, 1977.Google ScholarDigital Library
- 10.Joseph O'Rourke. Computational Geometry in U. Cambridge University Press, Cambridge, 1993. Google ScholarDigital Library
- 11.Charles C. Palmer and Aaron Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, volume 1, pages 379-384. IEEE Neural Networks Council and IEEE, June 1904.Google Scholar
- 12.Kaihuai Qin, Wenping Wang, and Minglun Gong. A genetic algorithm for the minimum weight triangulation. In Proceedings of 1997 IEEE Inter. national Conference on Evolutionary Computation, pages 541-546. IEEE, IEEE Neural Network Council, Evolutionary Programming Society, IEEE, April 1997.Google Scholar
- 13.j. David Schaffer and Larry J. Eshelman. Combinatorial optimization by genetic algorithms: the value of the genotype/phenotype distinction. In Vladimir Uskov, Bill Punch, and Erik D. Goodman, editors, First international Conference on Evolutionary Computation and its Applications: Program and Proceedings, pages 116-120, Moscow, Russia. 1996. Google ScholarDigital Library
Index Terms
- A weight-coded genetic algorithm for the minimum weight triangulation problem
Recommendations
New results for the minimum weight triangulation problem
Given a finite set of points in a plane, a triangulation is a maximal set of nonintersecting line segments connecting the points. The weight of a triangulation is the sum of the Euclidean lengths of its line segments. No polynomial-time algorithm is ...
The drawability problem for minimum weight triangulations
A graph is minimum weight drawable if it admits a straight-line drawing that is a minimum weight triangulation of the set of points representing the vertices of the graph. We study the problem of characterizing those graphs that are minimum weight ...
A parallel approximation algorithm for minimum weight triangulation
In this paper we show a parallel algorithm that produces a triangulation which is within a constant factor longer than the Minimum Weight Triangulation (MWT) in time O(log n) using O(n) processors and linear space in the CRCW PRAM model. We present a ...
Comments