A new heuristic for the minimum routing cost spanning tree problem

Proceedings - 11th International Conference on Information Technology, ICIT 2008

Volumn , Issue , 2008, Pages 9-13

  Singh, Alok ^a  

^a UNIVERSITY OF HYDERABAD   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION TECHNOLOGY; TREES (MATHEMATICS);

COMPUTATIONAL RESULTS; COST SPANNING TREE PROBLEMS; LOCAL SEARCHES; SPANNING TREES; UNDIRECTED GRAPHS;

COSTS;

EID: 62449302414     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIT.2008.16     Document Type: Conference Paper

References (12)

1. B. A. Julstrom, "The Blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem", Proceedings of the Genetic and Evolutionary Computation Conference 2005 (GECCO-2005), Hans-Georg Beyer et al.. Eds, vol. 1, ACM Press, New York, 2005, pp. 585-590.
2. D. S. Johnson, J. K. Lenstra, and A. H. G. Roonoy Kan, "The complexity of network design problem", Networks, vol. 8, 1978, pp. 279-285.
3. B. Y. Wu, and K. M. Chao, Spanning Trees and Optimization Problems, Chapter 4, CRC Press, New York, 2004.
4. T. C. Hu, "Optimum communication spanning tree", SIAM Journal on Computing, vol. 3, 1974, pp. 1888-195.
5. M. Fischetti, G. Lancia, and P. Serafini, "Exact algorithms for minimum routing cost trees", Networks, vol. 39, 2002, pp. 161-173.
6. R. Wong, "Worst case analysis of network design problem heuristics", SIAM Journal of Algebraic Discrete Mathematics, vol. 1, 1980, pp. 51-63.
7. B. Y. Wu, G. Lancia, V. Bafna, K. M. Chao, R. Ravi, and C. Y. Tang, "A polynomial time approximation schemes for minimum routing cost spanning trees", SIAM Journal on Computing, vol. 29, 1999, pp. 761-768.
8. S. Picciotto, How to Encode a Tree, PhD Thesis, University of California, San Diego, 1999.
9. G. R. Raidl, and B. A. Julstrom, "Edge-sets: an effective evolutionary coding of spanning trees", IEEE Transactions on Evolutionary Computation, vol. 7, 2003, pp. 225-239.
10. B. A. Julstrom, "A genetic algorithm and two hill climbers for the minimum routing cost spanning tree problem", Proceedings of the International Conference on Artificial Intelligence, H. R. Arabnia and Youngsong Mun, Eds., vol. III, CSREA Press, Las Vegas, 2002, pp. 934-940.
11. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, 1983, pp. 232-233.
12. R. C. Prim, "Shortest connection networks and some generalizations", Bell Systems Technical Journal, vol. 36, 1957, pp. 1389-1401.