Title :
Simulated annealing algorithm for finding the spanning directed trees with many leaves
Author :
Dai, Li ; Xie, Zheng
Author_Institution :
Coll. of Sci., Nat. Univ. of Defence Technol., Changsha, China
Abstract :
In order to solve the Maximum Leaf Spanning Tree Problem in digraph, a Simulated Annealing algorithm is proposed. The computational results for randomly generated graphs with up to 100 vertices show that the SA algorithm can get more leaves than ever before.
Keywords :
directed graphs; simulated annealing; trees (mathematics); digraph; maximum leaf spanning tree; simulated annealing algorithm; spanning directed trees; Approximation algorithms; Computers; Educational institutions; Optimized production technology; Presses; Simulated annealing; digraph; maximum leaf spanning tree; out-branching; simulated annealing;
Conference_Titel :
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-9762-1
DOI :
10.1109/CSSS.2011.5974942
