![](bg7.png)
poses three variants of ACO approach. All compo-
nents of each variant of ACO approach are the same
except the updating rule regarding the pheromone
trails component. All three variants of ACO ap-
proach have been tested on a set of randomly gen-
erated graph instances. Experimental results demon-
strate the effectiveness of solution quality obtained by
all three variants of ACO approach on each instance.
It was also found empirically that the performance
of all three variants of ACO approach are close to
each other. Convergence analysis on some instances
show that all three variants of ACO approach con-
verge rapidly towards the high quality solutions over
successive generations for such instances.
As a future work, other metaheuristic techniques
will be developed for this problem, as this problem
is under-studied in the domain of metaheuristic tech-
niques.
ACKNOWLEDGEMENTS
This work is supported in part by a grant (grant num-
ber YSS/2015/000276) from the Science and Engi-
neering Research Board – Department of Science &
Technology, Government of India.
REFERENCES
Alth
´
ofer, I., Das, G., Dobkin, D., Joseph, D., and Soares, J.
(1993). On sparse spanners of weighted graphs. Dis-
crete Comput. Geom., 9:81–100.
Awerbuch, B., Baratz, A., and Peleg, D. (1992). Efficient
broadcast and light-weight spanners.
Bhatt, S., Chung, F., Leighton, F., and Rosenberg, A.
(1986). Optimal simulations of tree machines. In Pro-
ceedings of 27th IEEE Foundation of Computer Sci-
ence, pages 274–282.
Birattari, M. (2005). Tuning Metaheuristics: A Machine
Learning Perspective. Springer-Verlag.
Cai, L. (1992). Tree spanners: Spanning trees that approxi-
mate distances.
Cai, L. and Corneil, D. (1995). Tree spanners. SIAM J.
Discrete Math., 8:359–387.
Dorigo, M., Maniezzo, V., and Colorni, A. (1991). Positive
feedback as a search strategy. Technical Report 91-
016, Dipartimento di Elettronica, Politecnico di Mi-
lano, Milan, Italy.
Dorigo, M. and St
¨
utzle, T. (2004). Ant Colony Optimiza-
tion. MIT Press, Cambridge, MA.
Dragan, F. F. and K
¨
ohler, E. (2014). An approximation al-
gorithm for the tree t-spanner problem on unweighted
graphs via generalized chordal graphs. Algorithmica,
69:884–905.
Eiben, A. E. and Smith, S. K. (2011). Parameter tun-
ing for configuring and analyzing evolutionary algo-
rithms. Swarm and Evolutionary Computation, 1:19–
31.
Emek, Y. and Peleg, D. (2008). Approximating minimum
max-stretch spanning trees on unweighted graphs.
SIAM J. Comput., 38:1761–1781.
Harel, D. and Tarjan, R. (1984). Fast algorithms for finding
nearest common ancestors. SIAM J. Comput., 13:338–
355.
Liebchen, C. and W
¨
unsch, G. (2008). The zoo of tree
spanner problems. Discrete Applied Mathematics,
156:569–587.
Liestman, A. and Shermer, T. (1993). Additive graph span-
ners. Networks, 23:343–364.
Moharam, R. and Morsy, E. (2017). Genetic algorithms to
balanced tree structures in graphs. Swarm and Evolu-
tionary Computation, 32:132–139.
Monteiro, M. S. R., Fontes, D. B. M. M., and Fontes, F.
A. C. C. (2015). The hop-constrained minimum cost
flow spanning tree problem with nonlinear costs: an
ant colony optimization approach. Optimization Let-
ters, 9:451–464.
Peleg, D. and Tendler, D. (2001). Low stretch spanning
trees for planar graphs.
Peleg, D. and Ullman, J. (1987). An optimal synchronizer
for the hypercube. In Proceedings of 6th ACM Sym-
posium on Principles of Distributed Computing, Van-
couver, pages 77–85.
Peleg, D. and Upfal, E. (1988). A tradeoff between space
and efficiency for routing tables. In Proceedings
of 20th ACM Symposium on Theory of Computing,
Chicago, pages 43–52.
Prim, R. (1957). Shortest connection networks and some
generalizations. Bell Systems Technical Journal,
36:1389–1401.
Sundar, S. and Singh, A. (2013). New heuristic approaches
for the dominating tree problem. Applied Soft Com-
puting, 13:4695–4703.
Sundar, S., Singh, A., and Rossi, A. (2012). New heuris-
tics for two bounded-degree spanning tree problems.
Information Sciences, 195:226–240.
Venkatesan, G., Rotics, U., Madanlal, M. S., Makowsky,
J. A., and Rangan, C. P. (1997). Restrictions of min-
imum spanner problems. Information and Computa-
tion, 136:143–164.