A new evolutionary approach to the degree-constrained minimum spanning tree problem

IEEE Transactions on Evolutionary Computation

Volumn 4, Issue 2, 2000, Pages 125-133

  Knowles, Joshua ^b   Corne, David ^b   Sidhu, S ^a   Nam, V C ^a   Sriram, P V J ^a   Jaeckle, S ^a   Thonke, F ^a   Soehendra, N ^a  

^a UNIVERSITY MEDICAL CENTER HAMBURG EPPENDORF   (Germany)

^b UNIVERSITY OF READING   (United Kingdom)

Author keywords

Degree constrained minimum spanning tree; Evolutionary algorithm; Hybrid heuristics; Multistart hillclimbing; Network design; Prim's algorithm; Simulated annealing

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GENETIC ALGORITHMS; ITERATIVE METHODS; RANDOM PROCESSES; SIMULATED ANNEALING; TREES (MATHEMATICS);

DEGREE-CONSTRAINED MINIMUM SPANNING TREES; MULTISTART HILLCLIMBING; RANDOMIZED PRIMAL METHOD (RPM);

COMPUTATIONAL METHODS;

EID: 0034225435     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.850653     Document Type: Article

References (16)

1. B. M. E. Moret and H. D. Shapiro, "An empirical analysis of algorithms for constructing a minimum spanning tree," DIMACS Series in Discrete Mathematics and Theoretical Comput. Sci., vol. 15, pp. 99-117, 1994.
2. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt, "Many birds with one stone: Multi-objective approximation algorithms," in Proc. 25th Annu. ACM STOCS, 1993, pp. 438-447.
3. S. C. Narula and C. A. Ho, "Degree-constrained minimum spanning tree," Comput. Operations Res., vol. 7, no. 4, pp. 39-49, 1980.
4. R. J. Wilson and J. J. Watkins, Graphs: An Introductory Approach: A First Course in Discrete Mathematics. New York: Wiley, 1990.
5. M. Savelsbergh and T. Volgenant, "Edge exchanges in the degree-constrained minimum spanning tree problem," Comput. Operations Res., vol. 12, no. 4, pp. 341-348, 1985.
6. S. Khuller, B. Raghavachari, and N. Young, "Low-degree spanning trees of small weight," SIAM J. Comput., vol. 25, no. 2, pp. 355-368, 1996.
7. S. P. Fekete, S. Khuller, M. Klemmstein, B. Raghavachari, and N. Young, "A network-flow technique for finding low-weight bounded-degree spanning trees," J. Algorithms, vol. 24, pp. 310-324, 1997.
8. B. Boldon, N. Deo, and N. Kumar, "Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine," Dept. Comput. Sci., Univ. Central Florida, Orlando, FL, Tech. Rep. CS-TR-95-02, 1995.
9. G. Zhou and M. Gen, "A note on genetic algorithms for degree-constrained spanning tree problems," Networks, vol. 30, pp. 91-95, 1997.
10. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications. Dordrecht, Netherlands: Reidel, 1987.
11. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
12. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP - Completeness. San Francisco, CA: Freeman, 1979.
13. C. Monma and S. Suri, "Transitions in geometric minimum spanning trees," Discrete Computational Geometry, vol. 8, pp. 265-293, 1992.
14. D. Cherition and R. E. Tarjan, "Finding minimum spanning trees," SIAM J. Comput., vol. 5, no. 4, pp. 724-741, Dec. 1976.
15. G. Syswerda, "Uniform crossover in genetic algorithms," in Proc. 3rd Int. Conf. Genetic Algorithms, J. D. Schaffer, Ed. San Mateo, CA: Morgan Kaufmann, 1989, pp. 2-9.
16. R. J. Collins and D. R. Jefferson, "Selection in massively parallel genetic algorithms," in Proc. 4th Int. Conf. Genetic Algorithms, R. K. Belew and L. B. Booker, Eds. San Mateo, CA, 1991, pp. 249-256.