A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
Sign Up to like & getrecommendations! 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
A Novel Integer-Coded Memetic Algorithm for the Set $k$ -Cover Problem in Wireless Sensor Networks
Sign Up to like & getrecommendations! 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