Improved heuristics for the bounded-diameter minimum spanning tree problem

Soft Computing

Volumn 11, Issue 10, 2007, Pages 911-921

  Singh, Alok ^a   Gupta, Ashok K ^a  

^a UNIVERSITY OF ALLAHABAD   (India)

Author keywords

Bounded diameter minimum spanning tree problem; Constrained optimization; Greedy heuristic; Steady state genetic algorithm; Uniform order based crossover

Indexed keywords

CONSTRAINED OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC METHODS; TREES (MATHEMATICS);

BOUNDED-DIAMETER MINIMUM SPANNING TREE PROBLEM; STEADY-STATE GENETIC ALGORITHM; UNIFORM ORDER-BASED CROSSOVER;

SOFT COMPUTING;

EID: 34248674387     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-006-0142-y     Document Type: Article

References (21)

1. Abdalla A, Deo N, Gupta P (2000) Random-tree diameter and the diameter constrained MST. Congr Numerantium 144:161-182
2. Achuthan NR, Caccetta L, Cacetta P, Geelen JF (1992) Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: Techniques and applications, pp 297-304
3. Bala K, Petropoulos K, Stern TE (1993) Multicasting in a linear lightwave network. In: Proceedings of IEEE INFOCOM-93, pp 1350-1358
4. Bookstein A, Klein ST (1996) Compression of correlated bit-vectors. Inf Syst 16:110-118
5. Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York
6. Deo N, Abdalla A (2000) Computing a diameter-constrained minimum spanning tree in parallel. Lecture Notes in Computer Science, vol. Springer, Berlin Heidelberg New York, pp. 17-31
7. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. W. H Freeman, San Francisco
8. Goldberg DE, Lingle JR (1985) Alleles, loci, and the travelling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms, pp 154-159
9. Julstrom BA, Raidl GR (2003) A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. GECCO 2003 Workshops Proceedings, Workshop on Analysis and Design of Representations, pp 2-7
10. Julstrom BA (2004a) Encoding bounded-diameter spanning trees with permutations and with random keys. Lecture Notes in Computer Science, vol 3102. Springer, Berlin Heidelberg New York, pp 1272-1281
11. Julstrom BA (2004b) Greedy heuristics for the bounded-diameter minimum spanning tree problem. Communicated to ACM J Exp Algorithmics
12. Kortsarz G, Peleg D (1997) Approximating shallow-light trees. In: Proceedings of the 8th Symposium on Discrete Algorithms, pp 103-110
13. Kortsarz G, Peleg D (1999) Approximating the weight of shallow Steiner trees. Discrete Appl Math 93:265-285
14. Prim R (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389-1401
15. Raidl GR, Julstrom BA (2003a) Edge-sets: An effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7:225-239
16. Raidl GR, Julstrom BA (2003b) Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 2003 ACM Symposium on Applied Computing, pp 747-752
17. Raymond K (1989) A tree-based algorithm for distributed mutual exclusion. ACM Trans Comput Syst 7:61-77
18. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5-13
19. Satyanarayanan R, Muthukrishnan DR (1992) A note on Raymond's tree-based algorithm for distributed mutual exclusion. Inf Process Letters 43:249-255
20. Satyanarayanan R, Muthukrishnan DR (1994) A static tree-based algorithm for the distributed readers and writers problem. Comput Sci Inform 24:21-32
21. Wang S, Lang SD (1994) A tree-based distributed algorithm for the k-entry critical section problem. In: Proceedings of the 1994 International Conference on Parallel and Distributed Systems, pp 592-597