Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem

Given an undirected and connected graph, the maximum leaf spanning tree problem consists in finding a spanning tree with as many leaves as possible. This NP-hard problem has practical applications in telecommunication networks, circuit layouts, and other graph-theoretic problems. An interesting application appears in the context of broadcasting in telecommunication networks, where it is interesting to reduce the number of broadcasting computers in the network. These components are relatively expensive and therefore its is desirable to deploy as few of them as possible in the network. This optimization problem is equivalent to maximize the number of non-broadcasting computers. We present a strategic oscillation approach for solving the maximum leaf spanning tree problem. The results obtained by the proposed algorithm are compared with the best previous algorithm found in the literature, showing the superiority of our proposal.

• Type: Journal
• Year: 2015
• Where: CAEPIA
• Authors: Jesús Sánchez-Oro, Abraham Duarte
• Keywords: Artificial Intelligence, CAEPIA 2015