The minimum 2-fold connected dominating set problem (M (2-fold) CDSP) is an important
variant of the traditional minimum connected dominating set problem (MCDSP), with crucial …

The minimum weight dominating set (MWDS) problem is an important generalization of the
minimum dominating set problem with various applications. In this work, we develop an …

With the rapid development of wireless communication and localization technologies, multi-
agent systems (MASs) have emerged as a powerful distributed artificial intelligence for …

The increasing demand for software customization has led to the development of highly
configurable systems. Combinatorial interaction testing (CIT) is an effective method for …

The generalized vertex cover problem (GVCP) is a well-known combinatorial problem of the
classic minimum vertex cover problem with rich applications. And local search algorithm is …

The weighted total domination problem (WTDP) is a practical extension of the well-known
total domination problem. The most efficient literature approaches to tackle this problem are …

The minimum weakly connected dominating set problem is a typical NP-hard problem with a
wide range of applications. To solve this problem, we propose a frequency property and two …

Security in wireless sensor networks (WSNs) is challenging, owing to resource, computing,
and environmental constraints. Researchers have proposed several security systems for …

Internet of Things (IoT) reliability evaluation contributes to the sustainable computing and
enhanced stability of the network. Previous algorithms usually evaluate the reliability of IoT …

The p-center problem, which is NP-hard, aims to select p centers from a set of candidates to
serve all clients while minimizing the maximum distance between each client and its …