Sign Up to like & get
recommendations!
1
Published in 2019 at "International Journal of Machine Learning and Cybernetics"
DOI: 10.1007/s13042-019-00933-6
Abstract: Minimal vertex cover problem (MVCP) is a famous important NP-hard problem in graph theory. It has been reported that MVCP is equivalent to finding reducts of information systems in rough sets theory. This relationship motivates…
read more here.
Keywords:
cover problem;
minimal elements;
vertex cover;
discernibility matrix ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2018 at "IEEE Transactions on Cybernetics"
DOI: 10.1109/tcyb.2017.2731598
Abstract: The Set ${k}$ -Cover problem aims to partition a set of nodes for the maximal number of covers. This problem is crucial for extending the lifetime of wireless sensor networks (WSNs) under the constraint of…
read more here.
Keywords:
cover problem;
tex math;
problem;
inline formula ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2024 at "IEEE Transactions on Neural Networks and Learning Systems"
DOI: 10.1109/tnnls.2024.3495836
Abstract: As a well-known NP-hard problem, the vertex cover problem has broad applications, which has aroused the concern of many researchers. In recent years, its related optimization problems, including the weighted vertex cover problem, the $\ell…
read more here.
Keywords:
optimization problems;
related optimization;
cover problem;
optimization ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2025 at "Mathematics"
DOI: 10.3390/math13152479
Abstract: Wireless sensor networks (WSNs) have attracted significant attention due to their widespread applications in various fields such as environmental monitoring, agriculture, intelligent transportation, and healthcare. In these networks, the power cost of a sensor node…
read more here.
Keywords:
cover problem;
power cover;
power;
sensor ... See more keywords