A restart local search algorithm with Tabu method for the minimum weighted connected dominating set problem

[1]  Minghao Yin,et al.  GRASP for connected dominating set problems , 2017, Neural Computing and Applications.

[2]  Xingming Sun,et al.  Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement , 2016, IEEE Transactions on Parallel and Distributed Systems.

[3]  Saïd Hanafi,et al.  An efficient tabu search approach for the 0-1 multidimensional knapsack problem , 1998, Eur. J. Oper. Res..

[4]  Alexandre Salles da Cunha,et al.  The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm , 2011, INOC.

[5]  Xiuzhen Cheng,et al.  Aggregation tree construction in sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[6]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[7]  Ling Shao,et al.  A rapid learning algorithm for vehicle classification , 2015, Inf. Sci..

[8]  Minghao Yin,et al.  A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem , 2017, Int. Trans. Oper. Res..

[9]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[10]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

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

[12]  Zhipeng Lü,et al.  Restricted swap-based neighborhood search for the minimum connected dominating set problem , 2017, Networks.

[13]  Bertrand M. T. Lin,et al.  An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem , 2004, Ann. Oper. Res..

[14]  Fred Glover,et al.  Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .

[15]  Lingmin Wang,et al.  Variable-depth neighborhood search algorithm for the minimum-connected dominating-set problem , 2016 .

[16]  Milan Tuba,et al.  Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem , 2013, Comput. Sci. Inf. Syst..

[17]  Zuleyha Akusta Dagdeviren,et al.  Two population-based optimization algorithms for minimum weight connected dominating set problem , 2017, Appl. Soft Comput..

[18]  Thomas Erlebach,et al.  Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.

[19]  Huan Liu,et al.  Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems , 2019, Mathematics.

[20]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[21]  Mohammad Reza Meybodi,et al.  Finding minimum weight connected dominating set in stochastic graph based on learning automata , 2012, Inf. Sci..

[22]  Zhihua Xia,et al.  A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data , 2016, IEEE Transactions on Parallel and Distributed Systems.

[23]  SunXingming,et al.  Steganalysis of least significant bit matching using multi-order differences , 2014 .

[24]  Weili Wu,et al.  New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs , 2011, Theor. Comput. Sci..

[25]  Peng Zhao,et al.  A hybrid metaheuristic algorithm for generalized vertex cover problem , 2016, Memetic Computing.

[26]  Jun Wu,et al.  An Efficient Local Search for the Maximum Edge Weighted Clique Problem , 2018, IEEE Access.

[27]  B. Sundar Rajan,et al.  Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems , 2010, IEEE Communications Letters.

[28]  Minghao Yin,et al.  NuMWVC: A novel local search for minimum weighted vertex cover problem , 2018, AAAI.

[29]  Jean-Guillaume Fages,et al.  An algorithm based on ant colony optimization for the minimum connected dominating set problem , 2019, Appl. Soft Comput..

[30]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[31]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[32]  Xiaohua Jia,et al.  Virtual backbone construction in multihop ad hoc wireless networks , 2006, Wirel. Commun. Mob. Comput..

[33]  Manuel Laguna,et al.  Tabu Search , 1997 .

[34]  Minghao Yin,et al.  A path cost-based GRASP for minimum independent dominating set problem , 2017, Neural Computing and Applications.

[35]  Christopher R. Houck,et al.  Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems , 1996, Comput. Oper. Res..

[36]  Minghao Yin,et al.  A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem , 2017, Neural Computing and Applications.

[37]  Lee Sael,et al.  BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs , 2015, SIGMOD Conference.

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

[39]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

[40]  Jun Wu,et al.  An Efficient Local Search Algorithm for the Minimum $k$ -Dominating Set Problem , 2018, IEEE Access.

[41]  Abdel-Rahman Hedar,et al.  Two Meta-Heuristics Designed to Solve the Minimum Connected Dominating Set Problem for Wireless Networks Design and Management , 2018, Journal of Network and Systems Management.

[42]  Sandip Roy,et al.  The influence model , 2001 .