Parallel strategic oscillation: an application to the maximum leaf spanning tree problem

The maximum leaf spanning tree problem consists in finding a spanning tree of a graph that maximizes the number of leaves that the tree has. This problem has been found to be $$\mathcal {NP}$$NP-hard for general graphs. It has several relevant applications in the context of telecommunication networks. In this paper, we tackle this problem by proposing the use of a parallel algorithm based on the strategic oscillation methodology. In particular, we propose two different parallel approaches and we compare our best variant with previous algorithms of the state of the art. The proposed approach outperforms previous ones in the state of the art, which is also confirmed by the use of statistical tests.

[1]  Francisco Gortázar,et al.  Path relinking for large-scale global optimization , 2011, Soft Comput..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Henning Fernau,et al.  An Exact Algorithm for the Maximum Leaf Spanning Tree Problem , 2009, IWPEC.

[4]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[5]  Si Chen,et al.  The regenerator location problem , 2010, Networks.

[6]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[7]  Mauricio G. C. Resende,et al.  Improved heuristics for the regenerator location problem , 2014, Int. Trans. Oper. Res..

[8]  Luis Gouveia,et al.  European Journal of Operational Research Minimal Spanning Trees with a Constraint on the Number of Leaves , 2022 .

[9]  Sergiy Butenko,et al.  Graph Domination, Coloring and Cliques in Telecommunications , 2006, Handbook of Optimization in Telecommunications.

[10]  Scott Oaks,et al.  Java Threads , 1997 .

[11]  Juan José Pantrigo,et al.  Parallel variable neighbourhood search strategies for the cutwidth minimization problem , 2016 .

[12]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[13]  Henning Fernau,et al.  An exact algorithm for the Maximum Leaf Spanning Tree problem , 2009, Theor. Comput. Sci..

[14]  M. Friedman.  The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance , 1937 .

[15]  Marc Sevaux,et al.  Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies , 2015, Electron. Notes Discret. Math..

[16]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[17]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[18]  Francisco Gortázar,et al.  Black box scatter search for general classes of binary optimization problems , 2010, Comput. Oper. Res..

[19]  R. Ravi,et al.  Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[20]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[21]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[22]  James A. Storer,et al.  Constructing Full Spanning Trees for Cubic Graphs , 1981, Inf. Process. Lett..

[23]  Abraham Duarte,et al.  Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem , 2015, CAEPIA.

[24]  Francisco Gortázar,et al.  A black-box scatter search for optimization problems with integer variables , 2014, J. Glob. Optim..

[25]  Mitsuhisa Sato,et al.  Guest Editors Introduction: Special Issue on OpenMP , 2008, International Journal of Parallel Programming.

[26]  Roberto Solis-Oba,et al.  A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.

[27]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.

[28]  Tetsuya Fujie,et al.  The maximum‐leaf spanning tree problem: Formulations and facets , 2004, Networks.