Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2003, Pages 747-752

  Raidl, Günther R ^a   Julstrom, Bryant A ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Bounded diameter spanning tree; Edge list encoding; Greedy heuristics; Local improvement; Randomized heuristics

Indexed keywords

EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

MINIMUM SPANNING TREE;

COMPUTER GRAPHICS;

EID: 0037998896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/952532.952678     Document Type: Conference Paper

References (18)

1. A. Abdalla, N. Deo, and P. Gupta. Random-tree diameter and the diameter constrained MST. Congressus Numerantium, 144:161-182, 2000.
2. K. Bala, K. Petropoulos, and T. E. Stern. Multicasting in a linear lightwave network. In IEEE INFOCOM'93, pages 1350-1358, 1993.
3. A. Bookstein and S. T. Klein. Compression of correlated bit-vectors. Information Systems, 16(4):110-118, 1996.
4. G. Chartrand and O. Oellermann. Applied and Algorithmic Graph Theory. McGraw-Hill, New York, 1993.
5. G. Dahl. The 2-hop spanning tree problem. Technical Report 250, University of Oslo, 1997.
6. N. Deo and A. Abdalla. Computing a diameter-constrained minimum spanning tree in parallel. In G. Bougiovanni, G. Gambosi, and R. Petreschi, editors, Algorithms and Complexity, number 1767 in LNCS, pages 17-31. Springer, Berlin, 2000.
7. M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
8. J. Gottlieb, B. A. Julstrom, F. Rothlauf, and G. R. Raidl. Prüfer numbers: A poor representation of spanning trees for evolutionary search. In L. Spector, E. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, editors, Proceedings of the 2001 Genetic and Evolutionary Computation Conference, pages 343-350. Morgan Kaufmann, 2000.
9. C. Jordan. Sur les assemblages des lignes. J. Reine Angew. Math., 70:185-190, 1869.
10. B. A. Julstrom. Encoding rectilinear Steiner trees as lists of edges. In G. Lamont, J. Carroll, H. Haddad, D. Morton, G. Papadopoulos, R. Sincovec, and A. Yfantis, editors, Proceedings of the 16th ACM Symposium on Applied Computing, pages 356-360. ACM Press, 2001.
11. G. Kortsarz and D. Peleg. Approximating shallow-light trees. In Proceedings of the 8th Symposium on Discrete Algorithms, pages 103-110, 1997.
12. G. Kortsarz and D. Peleg. Approximating the weight of shallow Steiner trees. Discrete Applied Mathematics, 93:265-285, 1999.
13. C. C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In D. Schaffer, H.-P. Schwefel, and D. B. Fogel, editors, Proceedings of the First IEEE Conference on Evolutionary Computation, pages 379-384. IEEE Press, 1994.
14. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
15. G. R. Raidi. An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In C. Fonseca, J.-H. Kim, and A. Smith, editors, Proceedings of the 2000 IEEE Congress on Evolutionary Computation, pages 104-111. IEEE Press, 2000.
16. G. R. Raidl and B. A. Julstrom. Edge-sets: An effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation. To appear.
17. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1):61-77, 1989.
18. F. Rothlauf, D. Goldberg, and A. Heinzl. Network random keys - a tree network representation scheme for genetic and evolutionary algorithms. Evolutionary Computation, 10(1):75-97, 2002.